杭电1212
Big Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5984 Accepted Submission(s): 4182
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 312 7152455856554521 3250
Sample Output
251521
分析:
大数取余问题,看起来很复杂。
但只要理解分步取余的思想,就很简单了。
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
char a[1005];
int b;
while (cin >> a >> b)
{
int s = 0;
for (int i = 0; i < strlen(a); i++)
{
s = s * 10 + a[i] - '0';
s = s%b;
}
cout << s << endl;
}
return 0;
}