Big Number

Big Number

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7227    Accepted Submission(s): 4996

Problem Description

As we know, Big Number is always troublesome. But it's really important in our ACM. And today, your task is to write a program to calculate A mod B.

To make the problem easier, I promise that B will be smaller than 100000.

Is it too hard? No, I work it out in 10 minutes, and my program contains less than 25 lines.

 

Input

The input contains several test cases. Each test case consists of two positive integers A and B. The length of A will not exceed 1000, and B will be smaller than 100000. Process to the end of file.

 

Output

For each test case, you have to ouput the result of A mod B.

 

Sample Input

  
  

   
   2 3
12 7
152455856554521 3250
  
  

 

Sample Output

  
  

   
   2
5
1521
  
  
  
  

   
   大数的取余问题主要是对数字取余时候运算规律的理解
  
  
  
  

   
   
#include<cstdio>
#include<cstring>
int main(){
    int b;
    char str[10100];
    while(~scanf("%s%d",str,&b)){
        int mod = 0,length=0;
        length=strlen(str);
        for(int i=0;i<length;i++){
            mod = mod * 10 + str[i]-'0';
            mod = mod % b;
        }//每次向前进一位*10
        printf("%d\n",mod);
    }
    return 0;
}