Pseudoprime numbers
来源:互联网 发布:翻墙用谷歌软件 编辑:程序博客网 时间:2024/06/05 10:51
POJ - 3641
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 isa. 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-apseudoprimes for all a.)
Given 2 < p ≤ 1000000000 and 1 < a < p, determine whether or not p is a base-apseudoprime.
Input contains several test cases followed by a line containing "0 0". Each test case consists of a line containing p and a.
For each test case, output "yes" if p is a base-a pseudoprime; otherwise output "no".
3 210 3341 2341 31105 21105 30 0
nonoyesnoyesyes
题意:判断a的p次幂(mod)p是否==a;&&p不是素数
思路:快速幂
AC 答案:
#include<stdio.h>
#include<math.h>
bool hanshu(__int64 t)
{
int i;
for(i=2;i<=sqrt(t);i++)
{
if(t%i==0) return 0;//bu shi su shu
}
return 1;//shi su shu
}
int main()
{
__int64 p,a;
__int64 t,b,sum;
while(~scanf("%I64d%I64d",&p,&a))
{
if(p==0&&a==0) break;
t=p;
b=a;
a=a%p;
sum=1;
while(p>0)
{
if(p%2==1)
{
sum=sum*a%t;
}
p/=2;
a=(a*a)%t;
}
sum=sum%t;
//printf("***%d\n",sum);
if(sum==b)
{
if(hanshu(t)==0)
{
printf("yes\n");
}
else
printf("no\n");
}
else
{
printf("no\n");
}
}
return 0;
}
- Pseudoprime numbers
- Pseudoprime numbers
- Pseudoprime numbers
- Pseudoprime numbers
- Pseudoprime numbers
- Pseudoprime numbers
- Pseudoprime numbers
- Pseudoprime numbers
- HDU1905 Pseudoprime numbers
- hdu1905||poj3641 Pseudoprime numbers
- POJ3641 Pseudoprime numbers
- soj 1454. Pseudoprime numbers
- POJ3641:Pseudoprime numbers
- hdu1905 Pseudoprime numbers
- POJ-3641-Pseudoprime numbers
- hdu 1905 Pseudoprime numbers
- hdu 1905 Pseudoprime numbers
- HDU1905 Pseudoprime numbers
- Java多线程
- iOS中图形图像处理第一部分:位图图像原图修改
- 选择排序
- 在变量作用域方面,函数声明和函数表达式有什么区别?
- mysql while loop repeat
- Pseudoprime numbers
- Matlab实现K均值聚类
- 南阳oj忙命逃窜,bfs
- git命令
- Linux下重要目录小结
- ajax提交表单时阻止表单自动提交
- 验证码插件
- element.style存在移动端浏览器兼容性问题
- ES6(五) 数值扩展