HDU - 2619 Love you Ten thousand years【原根】

Discription
Love you Ten thousand years------Earth’s rotation is a day that is the representative of a day I love you. True love, there is no limit and no defects. Earth’s revolution once a year, it is on behalf of my love you more than a year. Permanent horizon, and my heart will never change ……

We say that integer x, 0 < x < n,(n is a odd prime number) is a LovePoint-based-on n if and only if the set { (x i mod n) | 1 <= i <= n-1 } is equal to { 1, …, n-1 }. For example, the powers of 3 modulo 7 are 3, 2, 6, 4, 5, 1, and thus 3 is a LovePoint-based-on 7.
Now give you a integer n >= 3(n will not exceed 2 31).
We say the number of LovePoint-based-on n is the number of days the earth rotating.
Your task is to calculate the number of days someone loved you.

Input
Each line of the input contains an integer n. Input is terminated by the end-of-file.

Output
For each n, print a single number that gives the number of days someone loved you.

Sample Input

5

Sample Output

2

题意
问 0 ~ n 有多少个 x 满足，x ^ i % n (1 <= i <= n - 1) 形成的集合为 {1, 2, 3, … , n - 1}. n 为 奇素数

思路
这个题中 n 为奇素数，形成的为完全剩余系。
即求 n 的原根数量。
什么是原根

AC代码

#include<bits/stdc++.h>
using namespace std;

int Euler(int n)
{
    int ans=n;
    for(int i=2; i*i<=n; i++)
    {
        if(n%i==0)
        {
            ans=ans/i*(i-1);
            while(n%i==0)
                n/=i;
        }
    }
    if(n>1)
        ans=ans/n*(n-1);
    return ans;
}

int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        printf("%d\n",Euler(Euler(n)));
    }
    return 0;
}