HDU5430-----Reflect

最新推荐文章于 2015-10-11 21:33:20 发布

心向阳光2014

最新推荐文章于 2015-10-11 21:33:20 发布

阅读量347

点赞数

本文链接：https://blog.csdn.net/lv414333532/article/details/48247993

版权

Reflect

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 219 Accepted Submission(s): 140

Problem Description

We send a light from one point on a mirror material circle,it reflects

N times and return the original point firstly.Your task is calcuate the number of schemes.

Input

First line contains a single integer

T(T≤10) which denotes the number of test cases.

For each test case, there is an positive integer

N(N≤106) .

Output

For each case, output the answer.

Sample Input

1
4

Sample Output

Source

BestCoder Round #54 (div.2)

Recommend

hujie | We have carefully selected several similar problems for you: 5431 5429 5426 5425 5424

官方题解：

#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
const int N=1e6+5;
int phi[N];
void getphi()
{
    memset(phi,0,sizeof(phi));
    phi[1]=1;
    for(int i=2;i<N;i++)
    {
        if(!phi[i])
        {
            for(int j=i;j<N;j+=i)
            {
                if(!phi[j])phi[j]=j;
                phi[j]=phi[j]/i*(i-1);
            }
        }
    }
}
int main()
{
    getphi();
    int t,n;
    scanf("%d",&t);
    while(t--)
    {
         scanf("%d",&n);
         printf("%d\n",phi[n+1]);

    }
    return 0;
}