hdu 4002 java代码 可以做模板

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


public class Main {
    public static void main(String[] args) {
        Scanner cin=new Scanner(System.in);
        int t=cin.nextInt();
        int prime[]=new int [100];
        prime[1]=2;
        for (int i=2;i<=80;i++)
        {
            int j=prime[i-1]+1;
            while (true)
            {
                boolean b=true;
                for (int k=1;k<i;k++)
                    if (j%prime[k]==0)  {
                        b=false;
                        break;
                    }
                if (b) break;
                j++;
            }
            prime[i]=j;
        }
        BigInteger m[]=new BigInteger[100];
        m[1]=BigInteger.valueOf(prime[1]);
        for (int i=2;i<=80;i++)
            m[i]=m[i-1].multiply(BigInteger.valueOf(prime[i]));
        for (int k=1;k<=t;k++)
        {
            BigInteger s=cin.nextBigInteger();
            for (int i=1;i<=80;i++)
                if (m[i].compareTo(s)==1)
                {
                    System.out.println(m[i-1]);
                    break;
                }
        }
    }

}

http://acm.hdu.edu.cn/showproblem.php?pid=4002