# HDU - 4002 Find the maximum （Java大数打表）

234人阅读 评论(0)

HDU - 4002
 Time Limit: 1000MS Memory Limit: 65768KB 64bit IO Format: %I64d & %I64u

Description

Euler's Totient function, φ (n) [sometimes called the phi function], is used to determine the number of numbers less than n which are relatively prime to n . For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6.
HG is the master of X Y. One day HG wants to teachers XY something about Euler's Totient function by a mathematic game. That is HG gives a positive integer N and XY tells his master the value of 2<=n<=N for which φ(n) is a maximum. Soon HG finds that this seems a little easy for XY who is a primer of Lupus, because XY gives the right answer very fast by a small program. So HG makes some changes. For this time XY will tells him the value of 2<=n<=N for which n/φ(n) is a maximum. This time XY meets some difficult because he has no enough knowledge to solve this problem. Now he needs your help.

Input

There are T test cases (1<=T<=50000). For each test case, standard input contains a line with 2 ≤ n ≤ 10^100.

Output

For each test case there should be single line of output answering the question posed above.

Sample Input

2
10
100 

Sample Output

6
30 

Hint

If the maximum is achieved more than once, we might pick the smallest such n.


Source

The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest
//题意： 规定fai（n）的值为比n小且与n互质的数的个数

//思路：

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

public class Main {
static int vis[] = new int[1010];
static int p[] = new int[1010];
static BigInteger a[] = new BigInteger[110];
static void getp()
{
for(int i = 0; i < 1010; i++)
vis[i] = 0;
vis[1] = 1;
for(int i = 2; i <= 1000; i++)
{
if(vis[i] == 0)
for(int j = i * i; j <= 1000; j += i)
{
vis[j] = 1;
}
}
int tp = 0;
for(int i = 1; i <= 1000; i++)
{
if(vis[i] == 0)
p[tp++] = i;
}
}
public static void main(String[] args){
Scanner cin = new Scanner(System.in);
getp();
a[0]=BigInteger.valueOf(1);
for(int i=1;i<=100;i++)
{
a[i] = a[i-1].multiply(BigInteger.valueOf(p[i-1]));
}
int t = cin.nextInt();
while(t-- > 0)
{
BigInteger x;
x = cin.nextBigInteger();
if(x.compareTo(BigInteger.valueOf(6)) < 0){
System.out.println("2");
continue;
}
for(int i=0;i<=100;i++)
{
if(a[i].equals(x)){
System.out.println(a[i]);
break;
}
else if(a[i].compareTo(x) > 0)
{
System.out.println(a[i-1]);
break;
}
}
}
}
}


0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：260548次
• 积分：13318
• 等级：
• 排名：第1010名
• 原创：1116篇
• 转载：20篇
• 译文：0篇
• 评论：23条
阅读排行
最新评论