POJ 1284 Primitive Roots （欧拉函数--求原根数量）

题意：

给你一个奇素数P， 求有多少个x 满足 x^i %P 为0~P-1. 其中1 <= i <= p-1

思路：

这正是对原根的描述

假设一个数g 对于P来说是原根，那么g^i mod P 结果两两不同，且有1 < g < P i <1 < P，那么g可称P的一个原根。

这个题是求原根数量

为phi [ phi[n] ]个

欧拉函数直接打表就好了

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int phi[70000];

void init(){
    phi[1] = 1;
    for (int i = 2; i <= 65536; ++i) if (!phi[i]){
        for (int j = i; j <= 65536; j +=i){
            if (!phi[j])phi[j] = j;
            phi[j] = phi[j] / i * (i-1);

        }

    }



}

int main(){
    int n;
    init();
    while(~scanf("%d",&n)){

        printf("%d\n",phi[phi[n] ]);

    }

    return 0;
}

Primitive Roots Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 4119   Accepted: 2459 Description We say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (x i 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 Source 贾怡@pku

[Submit]   [Go Back]   [Status]   [Discuss]