2013
12-04

# Big Number

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.

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.

For each test case, you have to ouput the result of A mod B.

2 3
12 7
152455856554521 3250

2
5
1521

package com.njupt.bigInteger;

import java.math.BigInteger;
import java.util.Scanner;

public class HDU_1212_1 {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);

BigInteger a,b,c;

while(scanner.hasNextBigInteger()){
a = scanner.nextBigInteger();
b = scanner.nextBigInteger();
c = a.mod(b);//返回a%b的结果,赋给c

System.out.println(c);
}
}
}