Big Number
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 <iostream>
using namespace std;
int main()
{
char s[1111];
int b,i;
while(scanf("%s%d",s,&b)!=EOF)
{
int mod=0;
for(i=0;i<strlen(s);i++)
{
mod=mod*10+s[i]-'0';
mod%=b;
}
printf("%d\n",mod);
}
return 0;
}