POJ1942+找规律

import java.util.*;
import java.math.*;
import java.text.*;
import java.io.* ;

public class Main{
    public static void main( String args[] ){
        BigInteger n,m,tq;
        Scanner cin = new Scanner(new BufferedInputStream(System.in)); 
        while( cin.hasNext() ){
            n = cin.nextBigInteger();
            m = cin.nextBigInteger();
            if( (String.valueOf(n)).compareTo(String.valueOf(BigInteger.valueOf(0)))==0 && (String.valueOf(m)).compareTo(String.valueOf(BigInteger.valueOf(0)))==0 )
                    break;
            if( (String.valueOf(n)).compareTo(String.valueOf(BigInteger.valueOf(0)))==0||(String.valueOf(m)).compareTo(String.valueOf(BigInteger.valueOf(0)))==0 ){
                System.out.println("1");
                continue;
            }
            if( (String.valueOf(n)).compareTo(String.valueOf(m))<0 ){
                tq = n;
                n = m;
                m = tq;
            }
            BigInteger res;
            res = BigInteger.valueOf(1);
            n = n.add( m );
            BigInteger i ;
            i = BigInteger.valueOf(1);
            //System.out.println( i );
            //System.out.println( n );
            while( true ){
                res = res.multiply(n);
                res = res.divide(i);
                n = n.subtract(BigInteger.valueOf(1));
                i = i.add(BigInteger.valueOf(1));
                if( (String.valueOf(i)).compareTo(String.valueOf(m.add(BigInteger.valueOf(1))))==0 ) break;
                //System.out.println( res );
            }
            System.out.println( res );
        }
    }
}
            
                
            

C（n,m+n）