HDU 1212 Big Number (same remainder theorem)

Big number

Problem Descriptionas 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.

The problem easier, I promise that B'll be smaller than 100000.

Is it too hard? No, I work it out in the minutes, and my program contains less than lines.

Inputthe input contains several test cases. Each test case consists of positive integers A and B. The length of A would not exceed, and B would be smaller than 100000. Process to the end of file.

Outputfor Each test case, you have to ouput the result of A mod B.

Sample Input2 3 12 7 152455856554521 3250

Sample Output2 5 1521 Code:

1#include <cstdio>2#include <cstring>3 4 intMain ()5 {6     inta[1005];7     Chars[1005];8     intm,i,j;9      while(SCANF ("%s%d", s,&m)! =EOF)Ten     { One         intlen=strlen (s); A          for(j=0, i=len-1; i>=0; i--) -a[j++]=s[i]-'0'; -         intsum=0; the          for(j-=1; j>=0; j--) -Sum= (sum*Ten+A[J])%m; -printf"%d\n", sum); -     } +     return 0; -}

HDU 1212 Big Number (same remainder theorem)