Big Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7150 Accepted Submission(s): 4931
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.
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()
{
char a[1010];
int b;
while(~scanf("%s%d",a,&b))
{
int l,y;
l=strlen(a);
y=(a[0]-'0')%b; //同余定理
for(int i=1;i<l;i++)
{
y=(y*10+a[i]-'0')%b;
}
printf("%d\n",y);
}
}