Big Number HDU - 1212 （Java BigInteger）

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

 

题意：两个数取余

解题方法：同余定理或直接调用Java的大整数类

代码：

import java.util.*;
import java.math.*;

public class Main{
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		while(cin.hasNext()){
			String a = cin.next();
			String b = cin.next();
			BigInteger c = new BigInteger(a);
			BigInteger d = new BigInteger(b);
			c = c.mod(d);
			System.out.println(c);
		}
	}
}