acm--large number to take the mold--hdoj 1212--big number--water

Hdoj Title Address: Portal

Big numberTime limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others) Total Submission (s): 7350 Accepted Submission (s): 5079

Problem Descriptionas 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.

The problem easier, I promise that B'll be smaller than 100000.

Is it too hard? No, I work it out in the minutes, and my program contains less than lines.

Inputthe input contains several test cases. Each test case consists of positive integers A and B. The length of A would not exceed, and B would be smaller than 100000. Process to the end of file.

Outputfor Each test case, you have to ouput the result of A mod B.

Sample Input

2 312 7152455856554521 3250

Sample Output

251521

Import Java.math.bigdecimal;import Java.math.biginteger;import Java.util.scanner;public class Main {public   static void Main (string[] args) {    Scanner cin= new Scanner (system.in);     while (Cin.hasnext ()) {    BigInteger a=cin.nextbiginteger ();    BigInteger B=cin.nextbiginteger ();    BigInteger c= A.mod (b);    System.out.println (C.tostring ());}}}         

acm--large number to take the mold--hdoj 1212--big number--water