题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1212
Big Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4948 Accepted Submission(s): 3451
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<stdio.h>
#include<string.h>
int main()
{
int i,b,sum;
char a[1005];
while(scanf("%s%d",a,&b)!=EOF)
{
sum=0;
for(i=0;i<strlen(a);i++)
sum=(sum*10+(a[i]-'0'))%b;
printf("%d\n",sum);
}
return 0;
}