Big Number

Big Number

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6536    Accepted Submission(s): 4529

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
  
  

 

 

Source

杭电ACM省赛集训队选拔赛之热身赛

 

解题思路：A mod B 即A%B, A%B即从A的高位依次对B取余，例如：132110%3 ->1%3=1->13%3=1->132%3=0->1%3=1->11%3=2->20%3=2.

代码实现：

#include<stdio.h>
#include<string.h>
int main()
{
	char a[1010];//用字符串存储大数
	int i,j,temp,m;
	while(scanf("%s%d",&a,&m)!=EOF)
	{
		i=strlen(a);
		temp=(a[0]-'0')%m;//最高位对m取余
		for(j=1;j<i;j++)
		{
			temp=(temp*10+(a[j]-'0'))%m;
		}
		printf("%d\n",temp);
	}
	return 0;
}