hdoj1212(大数取余)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.

 

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
  
  

 

Author

Ignatius.L

 

此题用到同余定理，如下：

(a +b) mod c=(a mod c+b mod c)mod c;

(a *b)mod c=(a mod c*b mod c)modc;

代码如下：

#include<stdio.h>
#include<string.h>
int main()
{
	char a[1010];
	int b;
	while(~scanf("%s%d",a,&b))
	{
		int p=1,l=0;
		for(int i=strlen(a)-1;i>=0;i--)
		{
			l=(l+(a[i]-'0')*p)%b;
			p=(p*10)%b;
		}
		printf("%d\n",l);
	}
}