HDU1002: Large number addition, PE n times
ImportJava.util.Scanner;Importjava.math.*; Public classmain{ Public Static voidMain (string[] args) {Scanner cin=NewScanner (system.in); intT; T=Cin.nextint (); for(intz=1;z<=t;z++) { if(z!=1) System.out.println (); BigInteger A, B; A=Cin.nextbiginteger (); b=Cin.nextbiginteger (); System.out.println ("Case" +z+ ":"); System.out.println (A+ "+" +b+ "=" +A.add (b)); } cin.close (); }}View Code
hdu1042:n! large number multiplication
ImportJava.util.Scanner;Importjava.math.*;ImportJavax.naming.ldap.HasControls; Public classmain{ Public Static voidMain (string[] args) {Scanner cin=NewScanner (system.in); intT; while(Cin.hasnext ()) {BigInteger n=biginteger.valueof (1); T=Cin.nextint (); for(inti=2;i<=t;i++) {n=n.multiply (biginteger.valueof (i)); } System.out.println (n); } } }View Code
Hdu1316:how many Fibs?
Importjava.math.*;ImportJava.util.Scanner; Public classMain { Public Static voidMain (string[] args) {Scanner cin=NewScanner (system.in); BigInteger []f=Newbiginteger[1020]; f[0]=biginteger.valueof (1); f[1]=biginteger.valueof (1); f[2]=biginteger.valueof (2); for(inti=3;i<1019;i++) F[i]=f[i-1].add (f[i-2]); BigInteger A, B; intsum; while(Cin.hasnextbiginteger ()) {a=Cin.nextbiginteger (); b=Cin.nextbiginteger (); if(A.compareto (Biginteger.zero) ==0&&b.compareto (Biginteger.zero) ==0) Break; Sum=0; for(inti=1;i<=1015;i++) { if(F[i].compareto (a) >=0&&f[i].compareto (b) <=0) {sum++; } if(F[i].compareto (b) >0) Break; } System.out.println (sum); } cin.close (); }}
HDU1753: Daming a+b Large number addition plus some functions
Importjava.math.*;ImportJava.util.Scanner; Public classMain { Public Static voidMain (string[] args) {Scanner cin=NewScanner (system.in); BigDecimal A, B; while(Cin.hasnextbigdecimal ()) {a=Cin.nextbigdecimal (); b=Cin.nextbigdecimal (); System.out.println (A.add (b). Striptrailingzeros (). toplainstring ()); } cin.close (); }}
HDU implementation of large number of topics, continuous update (Java implementation)