Big numberTime
limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 5268 Accepted Submission (s): 3663
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
Authorignatius.l
SOURCE Hangzhou Electric ACM Provincial Training Team Qualifying match
Recommendeddy | We have carefully selected several similar problems for you:1215 1211 1214 1213 1695
Java large number algorithm, only one step! Please call me flood God!
Import java.io.*;import java.math.biginteger;import java.util.*;p ublic class main{public static void Main (string[] args {//TODO auto-generated method Stubscanner input = new Scanner (system.in); while (Input.hasnext ()) {BigInteger A = input.ne Xtbiginteger (); BigInteger B = Input.nextbiginteger (); BigInteger N = A.remainder (B); System.out.println (N);}}
Hdu-1212-big number
