hdu 6322 Euler Function（打表找规律）

最新推荐文章于 2020-02-07 23:31:47 发布

芋圆西米露

最新推荐文章于 2020-02-07 23:31:47 发布

阅读量170

点赞数

本文链接：https://blog.csdn.net/qq_41117236/article/details/81390442

版权

【题目】

Problem D. Euler Function

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 596 Accepted Submission(s): 492

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

Sample Output

【题解】

暴力打表然后发现除了12346，其他的欧拉数都为合数。

【代码】

#include<stdio.h>
main()
{
      long long t,k;
      scanf("%lld",&t);
      while(t--)
      {
          scanf("%lld",&k);
          if(k==1)
            printf("5\n");
          else
            printf("%lld\n",k+5);
      }
}