poj1248 Primitive Roots

Primitive Roots

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 4267		Accepted: 2501

Description

We say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (x ⁱ mod p) | 1 <= i <= p-1 } is equal to { 1, ..., p-1 }. For example, the consecutive powers of 3 modulo 7 are 3, 2, 6, 4, 5, 1, and thus 3 is a primitive root modulo 7. 
Write a program which given any odd prime 3 <= p < 65536 outputs the number of primitive roots modulo p. 

Input

Each line of the input contains an odd prime numbers p. Input is terminated by the end-of-file seperator.

Output

For each p, print a single number that gives the number of primitive roots in a single line.

Sample Input

23
31
79

Sample Output

10
8
24

求一个奇素数的原根的个数。

记住结论，套板子。

可以百度一下看看别人的证明什么哒

#include<stdio.h>
#define maxn  66666
int euler[maxn+1];
//筛法范围打表  nlogn
void phi()
{
    for(int i=1;i<=maxn;i++)
        euler[i]=i;
    for(int i=2;i<=maxn;i+=2)
        euler[i]/=2;
    for(int i=3;i<=maxn;i++)
    {
        if(euler[i]==i) //未被筛到。是素数，则用此素数来筛
        {
            for(int j=i;j<=maxn;j+=i)
            {
                euler[j]=euler[j]/i*(i-1);
            }
        }
    }
    return ;
}
int main()
{
    int n;
    phi();
    while(scanf("%d",&n)!=EOF)
    {
        printf("%d\n",euler[n-1]);
    }
}