hdu1212(大数取模) java版本

Big Number

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

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

AC代码

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

public class hdu1212 {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner scan=new Scanner(System.in);
        BigInteger a,b;
        while(scan.hasNext()){
            a=scan.nextBigInteger();
            b=scan.nextBigInteger();
            BigInteger result[]=a.divideAndRemainder(b);//求出余数的除法操作
            System.out.println(result[1]);
        }
    }

}