HDU 4002 数论

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

public class Main {
static Scanner cin;
static BigDecimal two;
static BigDecimal f1;
static BigInteger[] p = new BigInteger[401];
static int[] pr = new int[401];
static boolean[] jz = new boolean[10010];
static int cnt = 0;
static void init()
{
Arrays.fill(jz, true);
jz[1] = false;
for(int i = 2;;++i)
{
if(jz[i])
{
pr[++cnt] = i;
if(cnt == 400) break;
}
for(int j = 1; j <= cnt; ++j)
{
if(i * pr[j] > 10000) break;
jz[i * pr[j]] = false;
if(i % pr[j] == 0) break;
}
}
p[0] = BigInteger.ONE;
for(int i = 1; i <= 400; ++i)
p[i] = p[i - 1].multiply(BigInteger.valueOf(pr[i]));
}
public static void main(String[] args) {
cin = new Scanner(new BufferedInputStream(System.in));
init();
int T = cin.nextInt();
for(int kas = 0; kas < T; ++kas)
{
BigInteger n = cin.nextBigInteger();
int l = 1, r = 400;
while(r - l > 1)
{
int m = (l + r) >> 1;
if(p[m].compareTo(n) == 1) r = m;
else l = m;
}
System.out.println(p[l]);
}
cin.close();
}
}