hdu1212 Big Number

Big Number
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2920    Accepted Submission(s): 1984
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
   
   
   
   

 
 
Author
Ignatius.L
 
 
Source
杭電ACM省試合合宿チーム選抜試合のウォーミングアップ試合
 
 
Recommend
Eddy
 
 
アキュムレータ型
 

  
  
  
  

   
   
   
   
#include<stdio.h> 
   
   
   
   
 
   
   
   
   
int main(){ 
   
   
   
   
    char str[2000]; 
   
   
   
   
    int i,x,n; 
   
   
   
   
    while(scanf("%s%d",str,&x)!=EOF){ 
   
   
   
   
        i=n=0; 
   
   
   
   
        for(i;str[i];i++) 
   
   
   
   
            n=(n*10+str[i]-48)%x; 
   
   
   
   
        printf("%d
",n); 
   
   
   
   
    } 
   
   
   
   
    return 0; 
   
   
   
   
}