杭电1212 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

 

Source

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

 

Recommend

Eddy

    问题描述：给一个大正整数和一个32位整型数范围内的整数，求该大整数对此32位整型数的余数

    问题解答：字符串转换成整数的过程中进行取余。

#include <stdio.h>
#include <string.h>
#define MAX_INDEX 1000

int main()
{
    int m, len = 0, ans, i;
    char s[MAX_INDEX+5];
    memset(s,0,sizeof(s));
    while( scanf( "%s %d",s, &m ) != EOF )
    {
        ans = 0;
        len = strlen(s);
        for( i = 0; i < len; i++ )
            ans =(int)( ( (long long)ans*10+(s[i]-'0') ) % m );
        printf( "%d\n",ans );
    }
    return 0;
}