3199.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

Source

Problem Id:3199  User Id:fzk 
Memory:2936K  Time:250MS
Language:Java  Result:Accepted

Source 

import java.math.BigInteger;
import java.util.*;


public class Main
{
    static BigInteger c[][] = new BigInteger[11][26];
    public static void main(String args[])
    {
        Scanner cin = new Scanner(System.in);
        int i, j;

        for( i=1; i<11; i++ )
            c[i][0] = BigInteger.ONE;
        for( i=1; i<11; i++ )
        for( j=1; j<=25; j++ )
            c[i][j] = c[i][j-1].multiply( BigInteger.valueOf(i) );
        
        while( true ) {
            i = cin.nextInt();
            j = cin.nextInt();
            if( i == 0 && j == 0 )
                break;
            
            System.out.println( c[i][j] );
        }
        
        return;
    }

}