Big Number

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 34   Accepted Submission(s) : 24[align=left]Problem Description[/align]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.

[align=left]Input[/align]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.
[align=left]Output[/align]For each test case, you have to ouput the result of A mod B.
[align=left]Sample Input[/align][code]2 3
12 7
152455856554521 3250

2
5
1521

#include<stdio.h>#include<string.h>char x[1000000];int main(){int n,i,j,k,a,b,c;while(scanf("%s%d",x,&n)!=EOF){a=0;for(i=0;i<strlen(x);i++){a=a*10+x[i]-'0';a=a%n;}printf("%d\n",a);}return 0;}