Hdoj Problem D. Euler Function、欧拉函数打表、水题、规律：【题解】

Problem D. Euler Function

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)

Problem Description

In number theory, Euler’s totient function φ(n) counts the positive integers up to a given integer n that are relatively prime to n. It can be defined more formally as the number of integers k in the range 1≤k≤n for which the greatest common divisor gcd(n,k) is equal to 1.
For example, φ(9)=6 because 1,2,4,5,7 and 8 are coprime with 9. As another example, φ(1)=1 since for n=1 the only integer in the range from 1 to n is 1 itself, and gcd(1,1)=1.
A composite number is a positive integer that can be formed by multiplying together two smaller positive integers. Equivalently, it is a positive integer that has at least one divisor other than 1 and itself. So obviously 1 and all prime numbers are not composite number.
In this problem, given integer k, your task is to find the k-th smallest positive integer n, that φ(n) is a composite number.

Input

The first line of the input contains an integer T(1≤T≤100000), denoting the number of test cases.
In each test case, there is only one integer k(1≤k≤109).

Output

For each test case, print a single line containing an integer, denoting the answer.

Sample Input

2
1
2

Sample Output

5
7

题目大意：很多人搜索的原因应该是因为题意有点不理解，毕竟是非母语题嘛，总怕自己会在理解上有点偏差。本题要求第k个euler值为** composite number的 ，就是要从1到109之内，求第k个 composite number**（就是指euler值为合数（与素数相对）），可以从表中看出，除了下标为0、1、2、3、4、6、之外 euler值全为合数。那第一个合数就为euler[5] ，之后就是euler[k + 5]了。看代码吧！

AC代码如下：

#include <iostream>
using namespace std;
int main(){
    int n, T;
    scanf("%d", &T);
    while(T--){
    cin >> n;
    if(n == 1)
        printf("5\n");
    else
        printf("%d\n", n + 5);    
    }
    return 0;
}