Pseudoprime numbers 【poj-3641】【快速幂】
来源:互联网 发布:网络推广是传销吗 编辑:程序博客网 时间:2024/05/17 04:44
Description
Fermat's theorem states that for any prime number p and for any integer a > 1, ap = a (mod p). That is, if we raise a to the pth power and divide by p, the remainder is a. Some (but not very many) non-prime values of p, known as base-a pseudoprimes, have this property for some a. (And some, known as Carmichael Numbers, are base-a pseudoprimes for all a.)
Given 2 < p ≤ 1000000000 and 1 < a < p, determine whether or not p is a base-a pseudoprime.
Input
Input contains several test cases followed by a line containing "0 0". Each test case consists of a line containing p and a.
Output
For each test case, output "yes" if p is a base-a pseudoprime; otherwise output "no".
Sample Input
3 210 3341 2341 31105 21105 30 0
Sample Output
nonoyesnoyesyes
题意:输入两个数,判断公式 a^p=a(mod p)是否成立,即a的p次方对p求模是否等于a。只有当p是非素数时且等式成立时,才输出yes。其他情况输出no。
题解:利用快速幂算法,简单的素数判定。
代码如下:
#include<cstdio>typedef long long ll;bool Prime_judge(ll q){for(ll i=2;i*i<=q;i++){if(q%i==0) return false;}return true;}ll p,a;ll mod_pow(ll x,ll n){ll res=1;while(n>0){if(n&1) res=res*x%p;x=x*x%p;n>>=1;}return res;}int main(){while(scanf("%lld%lld",&p,&a)){if(p==0&&a==0) break;if(Prime_judge(p)){printf("no\n");}else{ll ans=mod_pow(a,p);ans=ans%p;if(ans==a) printf("yes\n");else printf("no\n");}}return 0;}
- poj 3641 Pseudoprime numbers 【快速幂】
- POJ 3641 - Pseudoprime numbers(快速幂)
- Pseudoprime numbers(POJ-3641)(快速幂)
- POJ 3641 Pseudoprime numbers(快速幂+素数)
- POJ 3641 Pseudoprime numbers【素数+快速幂】
- POJ 3641 Pseudoprime numbers (快速幂)
- POJ:3641 Pseudoprime numbers(快速幂)
- poj-3641-Pseudoprime numbers【快速幂】
- POJ 3641 Pseudoprime numbers 【快速幂】
- poj 3641 Pseudoprime numbers 快速幂算法
- POJ 3641 Pseudoprime numbers (快速幂)
- Pseudoprime numbers 【poj-3641】【快速幂】
- [快速幂] POJ-3641 Pseudoprime numbers
- POJ-3641 Pseudoprime numbers(快速幂)
- [数论]POJ 3641/HOJ 2700 Pseudoprime numbers 快速幂
- POJ 3641 Pseudoprime numbers (快速幂、素性测试)
- POJ 3641 Pseudoprime numbers (伪素数_快速幂)
- poj 3641 Pseudoprime numbers 快速幂+素数判定 模板题
- OpenCV(七) Opencv中 core 核心模块详解—提取感兴趣区域Roi
- 微信小程序开发-增加mixin扩展
- AtCoder
- COM聚集是什么意思
- vue2.0初始化一个头部组件
- Pseudoprime numbers 【poj-3641】【快速幂】
- COM技术内幕
- COM中的IDL语言的难点之接口指针
- 异步两周年庆/豪送20本图书,1000种图书任你选
- ActiveX资源
- eclipse Kepler 支持 jdk8 操作步骤
- 栈和队列的区别
- MFC多线程编程
- 仿照标准库做了个hashmap!不容易啊。