Sdut implementation of large number of topics, continuous update (Java implementation)

Sdut2525:a-b (template title)

ImportJava.util.Scanner;Importjava.math.*; Public classmain{ Public Static voidMain (string[] args) {Scanner ci=NewScanner (system.in);        BigInteger A;        BigInteger b;  while(Ci.hasnext ()) {a=Ci.nextbiginteger (); b=Ci.nextbiginteger ();        System.out.println (A.subtract (b));    } ci.close (); }}

SDUT3134: Large number to take the mold

ImportJava.util.Scanner;Importjava.math.*; Public classmain{ Public Static voidMain (string[] args) {Scanner cin=NewScanner (system.in);  while(Cin.hasnext ()) {BigInteger A, B; A=Cin.nextbiginteger (); b=Cin.nextbiginteger ();                    System.out.println (A.mod (b));    } cin.close (); }} 

View Code

SDUT2613: Large number addition

ImportJava.util.Scanner;Importjava.math.*; Public classmain{ Public Static voidMain (string[] args) {Scanner cin=NewScanner (system.in);  while(Cin.hasnext ()) {BigInteger A, B; A=Cin.nextbiginteger (); b=Cin.nextbiginteger ();                    System.out.println (A.add (b));    } cin.close (); }} 

View Code

SDUT2763: Fun Five-time Square

The problem is still better, using the Pow method in math, which is a large number multiplication

Importjava.util.Arrays;ImportJava.util.Scanner;Importjava.math.*; Public classmain{ Public Static voidMain (string[] args) {Scanner cin=NewScanner (system.in); intn,t,cnt,ff;  while(Cin.hasnext ()) {n=Cin.nextint (); CNT=0; FF=-1; int[] A=New int[n]; int[] b=New int[n];  for(inti=0;i<n;i++) {A[i]=Cin.nextint ();            } arrays.sort (a);  for(inti=0;i<n;i++)            {                if(a[i]>0) b[cnt++]=A[i]; }             for(inti=0;i<cnt;i++)            {                if(B[i]!= (i+1) ) {FF=i+1;  Break; }            }            if(ff==-1) ff=cnt+1; BigInteger sum=biginteger.valueof (FF); System.out.println (Sum.pow (5));    } cin.close (); }} 

Sdut implementation of large number of topics, continuous update (Java implementation)