hdu 1212

Big Number

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

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

import java.io.*;
import java.util.*;
import java.math.BigInteger;

public class Main
{
    public static void main(String args[])
    {
        BigInteger big1 = new BigInteger("0");
		BigInteger big2 = new BigInteger("0");
		Scanner cin = new Scanner (System.in);

		while(cin.hasNext())
		{
			big1 = cin.nextBigInteger();
			big2 = cin.nextBigInteger();
			big1 = big1.remainder(big2);
			System.out.println(big1);
		}
    }
}

另外一个网上方法，不甚了解：

//同余定理：
//(a+b)%c=(a%c+b%c)%c;
//(a*b)%c=(a%c*b%c)%c;
#include <stdio.h>
int main()
{
	char a[1001];
	int b, r, i;
	while (~scanf("%s%d", a, &b))
	{
		r = 0;
		for(i = 0; a[i] != '\0'; i++)
		{
			r = r * 10 + a[i] - '0';
			r %= b;
		}
		printf("%d\n", r);
	}
	return 0;
}