HDU1212 BIG NUMBER (MOD)

题目链接：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): 4716    Accepted Submission(s): 3272

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
  
  
  
  


  
  

/*

(a * b) % c = ((a % c) * (b % c)) % c
(a + b) % c = ((a % c) + (b % c)) % c
10000位大的数字可以分开算：
比如：
m=123
秦九韶算法：
123 = (1*10 + 2)*10 + 3
m%n = 123%n = (((1%n * 10%n + 2%n)%n * 10%n) % n + 3%n)%n
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
    char str[1005];
    int n;
    while(scanf("%s %d",str,&n)!=EOF)
    {
        int k = strlen(str);
        int i;

        int r = 0;
        for(i=0;i<k;i++)
        {
            r*=10;
            r=(r+str[i]-48)%n;
        }
        printf("%d\n",r);
    }
    return 0;
}