POJ3641 Pseudoprime numbers 【快速幂】
来源:互联网 发布:平面设计软件下载 编辑:程序博客网 时间:2024/03/29 09:10
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
Source
#include <stdio.h>#include <string.h>#include <math.h>typedef long long LL;bool isPrime(int n) { if(n < 2) return false; int t = sqrt((double)n); for(int i = 2; i <= t; ++i) if(n % i == 0) return false; return true;}LL mod_power(LL x, LL n, LL mod) { LL ret = 1; for( ; n > 0; n >>= 1) { if(n & 1) ret = ret * x % mod; x = x * x % mod; } return ret;}int main() { LL p, a; while(scanf("%lld%lld", &p, &a), p | a) { if(isPrime(p)) printf("no\n"); else printf(mod_power(a, p, p) == a ? "yes\n" : "no\n"); } return 0;}
- POJ3641 Pseudoprime numbers 快速幂
- POJ3641 Pseudoprime numbers 【快速幂】
- Pseudoprime numbers(poj3641)快速幂
- Pseudoprime numbers poj3641(快速幂+素数判定)
- POJ3641 UVA11287 HDU1905 Pseudoprime numbers【素数判定+快速模幂】
- POJ3641 Pseudoprime numbers(快速幂取模)
- hdu1905||poj3641 Pseudoprime numbers
- POJ3641 Pseudoprime numbers
- POJ3641:Pseudoprime numbers
- POJ3641-Pseudoprime numbers
- POJ3641(Pseudoprime numbers 费马小定理)
- POJ3641 Pseudoprime numbers 素数测试的应用
- Pseudoprime numbers(快速幂)
- poj 3641 Pseudoprime numbers 【快速幂】
- POJ 3641 - Pseudoprime numbers(快速幂)
- Pseudoprime numbers(POJ-3641)(快速幂)
- POJ 3614 Pseudoprime numbers(快速幂)
- POJ 3641 Pseudoprime numbers(快速幂+素数)
- NESASM教程——第四天——制作、载入调色板
- Java多线程-新特征-信号量Semaphore
- 第12周 项目2-(1)求n组数中的最大公约数
- 《人月神话》读后感
- C和指针(3)指针
- POJ3641 Pseudoprime numbers 【快速幂】
- linux 定时重启 tomcat
- UML--------三大结构
- 北京大学光华管理学院2015年工商管理硕士(MBA)专业学位研究生招生简章
- 网关批处理等检查步骤详解
- 看来科幻电影快成为真的了
- CodeIgniter框架中关于URL重写(index.php)的二三事
- Kinect V2彩色数据用OpenCV显示
- 字符串:计算单词