JAVA的acm用法

<span style="font-family: Arial, Helvetica, sans-serif;"> </span>

import java.math.*;
import java.util.*;
public class Main {
		public static void main(String[] args) {
				Scanner cin = new Scanner(System.in);
				BigInteger c = new BigInteger("0");
				while(cin.hasNext()){
					BigInteger a = cin.nextBigInteger();
					BigInteger b = cin.nextBigInteger();
					if((a.compareTo(c)==0) && (b.compareTo(c)==0))
						break;
					int ok = a.compareTo(b);
					if(ok==0)
						System.out.println("a==b");
					else if(ok==-1)
						System.out.println("a<b");
					else
						System.out.println("a>b");
				}
				
		}
}
        

大数比较大小。

 
import java.math.*;
import java.util.*;
public class Main {
		public static void main(String[] args) {
				Scanner cin = new Scanner(System.in);
				while(cin.hasNext()){
					int a = cin.nextInt();
					BigInteger ans = new BigInteger("1");
					for(int i=1;i<=a;i++)
					{
						BigInteger tmp = BigInteger.valueOf(i);
						ans = ans.multiply(tmp);
					}
					System.out.println(ans);
				}
		}
}
        

nyoj 155 大数次方

import java.math.*;
import java.util.*;
public class Main {
		public static void main(String[] args) {
				Scanner cin = new Scanner(System.in);
				while(cin.hasNext()){
					BigDecimal a = cin.nextBigDecimal();
					BigDecimal ans = new BigDecimal("1.0");
					int num = cin.nextInt();
					ans = a.pow(num);
//					for(int i=1;i<=num;i++)
//					{
//						ans = ans.multiply(a);
//					}
					String str = ans.stripTrailingZeros().toPlainString();
					if(str.startsWith("0")) //取掉前导0
						str = str.substring(1);
					System.out.println(str);
				}
		}
}

hdoj 1715

import java.math.*;
import java.util.*;
public class Main {
        public static void main(String[] args) {
                Scanner cin = new Scanner(System.in);
                BigInteger []a = new BigInteger[1005];
                a[1] = a[2] = new BigInteger("1");
                for(int i=3;i<=1001;i++)
                {
                    a[i] = a[i-1].add(a[i-2]);
                }
                int n,T;
                T = cin.nextInt();
                for(int cas = 1;cas<=T;cas++)
                {
                    n = cin.nextInt();
                    System.out.println(a[n]);
                }
        }
}

hdoj 4927 

import java.math.*;
import java.util.*;
public class Main{
		public static void main(String[] args) {
				Scanner cin = new Scanner(System.in);
				int n,T;
				int []a = new int[3005];
				T = cin.nextInt();
				for(int cas = 1;cas<=T;cas++)
				{
					n = cin.nextInt();
					for(int i=1;i<=n;i++)
					{
						a[i] = cin.nextInt();
					}
					BigInteger pos,neg,c;
					pos = neg = new BigInteger("0");
					c = new BigInteger("1");
					for(int i=0;i<=n-1 ;i++)
					{
						if(i>0)
						{
							c = c.multiply(BigInteger.valueOf(n-i));
							c = c.divide(BigInteger.valueOf(i));
						}
						BigInteger tmp = c.multiply(BigInteger.valueOf(a[n-i]));
						if(i%2==1)
							neg = neg.add(tmp);
						else
							pos = pos.add(tmp);
					}
					BigInteger ans = pos.subtract(neg);
					System.out.println(ans);
				}
		}
}