Big Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7253 Accepted Submission(s): 5015
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
问题描述
大数取模问题
问题分析
由取模运算符的性质知(a+b)%c=(a%c+b%c)%c、(a*b)%c=(a%c*b%c)%c
例如
567%7=(500+60+7)%7
=(500%7+60%7+7%7)%7
=(50%7*10%7+6%7*10%7+7%7)%7
=(50%7+6%7)*10%7+7%7)%7
=(5%7*10%7+6%7)*10%7+7%7)%7
AC代码
#include<iostream>
#include<string>
using namespace std;
int mod(string n1,int n2)
{
int temp=0;
int len=n1.size();
for(int i=0; i<len; i++)
{
temp=temp*10+n1[i]-'0';
temp=temp%n2;
}
return temp;
}
int main()
{
string s;
int n;
while(cin>>s>>n)
{
cout<<mod(s,n)<<endl;;
}
return 0;
}