校赛 E 题 Cows and Primitive Roots
2013-04-15 01:57
183 查看
题目链接
这是我从codeforce中找到的一道题:
就是模拟,要注意边计算边取mod,这样才不会爆int~~
#include<stdio.h>
int n;
int judge(int num){
int tmp=1,i;
for(i=1;i<=n-2;i++){
tmp=tmp*num%n; //边乘边取mod
if( (tmp-1)%n==0)break;
}
if(i<=n-2)return 0;
if( (tmp*num-1)%n==0)return 1;
else return 0;
}
int main()
{
int t;
while(scanf("%d",&n)!=EOF){
int times=0;
for(int i=1;i<n;i++){
if(judge(i)==1)times++;
}
printf("%d\n",times);
}
}
这是我从codeforce中找到的一道题:
就是模拟,要注意边计算边取mod,这样才不会爆int~~
#include<stdio.h>
int n;
int judge(int num){
int tmp=1,i;
for(i=1;i<=n-2;i++){
tmp=tmp*num%n; //边乘边取mod
if( (tmp-1)%n==0)break;
}
if(i<=n-2)return 0;
if( (tmp*num-1)%n==0)return 1;
else return 0;
}
int main()
{
int t;
while(scanf("%d",&n)!=EOF){
int times=0;
for(int i=1;i<n;i++){
if(judge(i)==1)times++;
}
printf("%d\n",times);
}
}
相关文章推荐
- A. Cows and Primitive Roots
- Codeforces 284A Cows and Primitive Roots [模拟题]
- Codeforces Round #174 (Div. 2) Cows and Primitive Roots(数论)
- 284A. Cows and Primitive Roots
- 299. Bulls and Cows
- "Isomorphic Strings" and "Bulls and Cows"
- Configure Trusted Roots and Disallowed Certificates
- 299. Bulls and Cows
- [Leetcode] Bulls and Cows
- UVa 10491 Cows and Cars(概率计算)
- UVA 10491 Cows and Cars(概率)
- 299. Bulls and Cows 自己写已ac
- Leetcode299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows
- Primitive Service Model and Interceptor in HiveMind
- LeetCode 299 : Bulls and Cows (Java)
- LeetCode 之 Bulls and Cows
- LeetCode 299:Bulls and Cows