hdu5430（BestCoder Round #54 (div.2)1004题）

Reflect

Accepts: 72

Submissions: 302

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)

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

4

分析：这题是由UVa12493题改编的，但几乎是一模一样的。因为之前碰到过，某学长有详细的解析报告。我就不瞎扯了。

附上学长博客：寻找&星空の孩子

#include<stdio.h>
#define LL long long
//UVA用
LL fun(LL m)
{
    LL res=m;
    for(LL i=2;i*i<=m;i++)
    {
        if(m%i==0)
        {
            res=(res*(i-1))/i;
 //           printf("i=%I64d,res=%I64d\n",i,res);
            while(m%i==0)
            {
                m/=i;
            }
        }
    }
    if(m>1) res=(res*(m-1))/m;
    return res;
}
int main()
{
    LL n;
    int T;
    scanf ("%d",&T);
    while(T--)
    {
        scanf("%lld",&n);
        printf("%lld\n",fun(n+1));
    }
    return 0;
}