poj
来源:互联网 发布:淘宝美工如何做首页 编辑:程序博客网 时间:2024/06/06 03:55
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.
Write a program which given any odd prime 3 <= p < 65536 outputs the number of primitive roots modulo p.
Each line of the input contains an odd prime numbers p. Input is terminated by the end-of-file seperator.
For each p, print a single number that gives the number of primitive roots in a single line.
233179
10824
题目让求一个奇素数的原根的个数
有定理:如果p为素数,那么素数p一定存在原根,又因为当模p有原根时,它有φ(φ(p))个原根,那么对于素数p的原根的个数为φ(p−1)。
具体定义见百科:原根,http://blog.csdn.net/muxidreamtohit/article/details/8026611
代码:
#include<iostream>#include<string>#include<cstdio>#include<algorithm>#include<cmath>#include<iomanip>#include<queue>#include<cstring>#include<map>using namespace std;typedef long long ll;#define M 65540int phi[M];void init() //预先求出所有的欧拉函数{ int i,j; for(i=2;i<M;i++) phi[i]=0; phi[1]=1; for(i=2;i<M;i++) if(!phi[i]) { for(j=i;j<M;j+=i) { if(!phi[j]) phi[j]=j; phi[j]=phi[j]/i*(i-1); } }}int main(){ init(); int n; while(scanf("%d",&n)!=EOF) { printf("%d\n",phi[n-1]); } return 0;}
阅读全文
0 0
- POJ
- poj
- POJ
- POJ
- poj
- poj
- POJ
- POJ
- poj
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- SpringMVC的注解
- Thinkphp5多数据库切换
- sdnu oj 1056 A ^ B Problem
- 【小白的CFD之旅】07 CFD常识
- 粒子物理蒙特卡罗模拟库Geant4开发之一个实例
- poj
- 【小白的CFD之旅】08 CFD速成之道
- 【Swish激活函数】
- C和指针之数组编程练习8(8皇后问题)
- Scrapy爬虫地位与应用展望
- 苦啊!!!!
- Service详解
- 如何在SolidWorks中截出高清质量的图片
- 在安装setuptools工具时出现缺少zlib module