java 大数 以后遇到了再添加吧~ ^ _ ^

hdu 1316  How Many Fibs?

import java.math.BigInteger;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc =new Scanner(System.in);
        BigInteger f[]=new BigInteger[530];
        f[1]=new BigInteger("1");
        f[2]=new BigInteger("2");
        for(int i=3;i<=520;i++)
        {
            f[i]=f[i-2].add(f[i-1]);
            //System.out.println(i+"   "+f[i]);
        }        
        while(sc.hasNextBigInteger())
        {
            BigInteger n,m,zero;
            zero=new BigInteger("0");
            n=sc.nextBigInteger();
            m=sc.nextBigInteger();
            if(n.compareTo(zero)==0&&m.compareTo(zero)==0)
                break;
            int left=1,right=520,mid=0;
            int best=100000;
            while(left<=right)
            {
                
                mid=(left+right)/2;
               if(f[mid].compareTo(n)>=0)
                {
                   if(mid<best)
                       best=mid;
                    right=mid-1;
                    
                }
                else
                {
                    left=mid+1;
                }        
            }
            int ansl,ansr;
            ansl=best;        
            left=0;right=520;
             best=0;
            while(left<=right)
            {
                
                mid=(left+right)/2;
            
                if(f[mid].compareTo(m)<=0)
                {
                    if(best<mid)
                        best=mid;
                    left=mid+1;
                    
                }
                else
                {
                    right=mid-1;
                }        
            }
            ansr=best;
            System.out.println(ansr-ansl+1);    
            //System.out.println(ansl);    
            //System.out.println(ansr);                            
        }        
    }
}

 hdu 1063    n^m舍去多余的0

import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.Scanner;


public class Main {
    public static void main(String[] args) {
        BigDecimal n,ans;
       
        Scanner sc=new Scanner(System.in);
        while(sc.hasNextBigDecimal())
        {
            int m;
            n=sc.nextBigDecimal();
            m=sc.nextInt();
            ans=new BigDecimal("1");
            for(int i=0;i<m;i++)
                ans=ans.multiply(n);
            ans=ans.stripTrailingZeros();
            String str=ans.toPlainString();
            if(str.startsWith("0."))
                str=str.substring(1);       //以从1开始的子串为新串
            System.out.println(str);
            
                
            
        }
       
        
        
    }

}

hdu 1047

import java.math.BigInteger;
import java.util.Scanner;


public class Main {
    public static void main(String[] args) {
        BigInteger ans,n,one,i,zero,m;
        Scanner sc=new Scanner(System.in);
        n=sc.nextBigInteger();
        zero=new BigInteger("0");
        
        one=new BigInteger("1");
        while(n.compareTo(zero)>0)
        {
            ans=new BigInteger("0");            
            while(true)
            {
                m=sc.nextBigInteger();
                if(m.compareTo(zero)==0)
                    break;
                ans=ans.add(m);
            }
            System.out.println(ans);
            n=n.subtract(one);
            if(n.compareTo(zero)!=0)
                System.out.println("");
            
        }
        
        
    }

}

hdu 1042

//package 大数;

import java.math.BigInteger;
import java.util.Scanner;


public class Main {
    
    public static void main(String[] args) {
        BigInteger ans,i,n,one;
        Scanner sc=new Scanner(System.in);
        while(sc.hasNextBigInteger())
        {
            n=sc.nextBigInteger();
            one=new BigInteger("1");
            ans=new BigInteger("1");
            i=new BigInteger("1");
            
            while(i.compareTo(n)<=0)
            {
            
            
                ans=ans.multiply(i);
                
                i=i.add(one);
                
                
            }
            System.out.println(ans);
            
        }
    }

}