POJ 1284 Primitive Roots 原根个数

模p下的原根个数为$\phi(p-1)$

#include <cstdio>
int main() {
    int x, ans, i, y;
    while (scanf("%d", &x) == 1) {
        ans = 1; --x; y = x;
        for (i = 2; i * i <= y; ++i)
            if (x % i == 0) {
                x /= i, ans *= i - 1;
                while (x % i == 0) x /= i, ans *= i;
            }
        if (x > 1) ans *= x - 1;
        printf("%d\n", ans);
    }
    return 0;
}

Primitive Roots

Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 3562 Accepted: 2081

Description

We say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (xi 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