Pseudoprime numbers
来源:互联网 发布:pc软件下载吧 编辑:程序博客网 时间:2024/05/17 01:38
Fermat's theorem states that for any prime number p and for any integer a > 1, a^p == 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 ≤ 1,000,000,000 and 1 < a < p, determine whether or not p is a base-a pseudoprime.
Given 2 < p ≤ 1,000,000,000 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
Author
Gordon V. Cormack
Source
2008-1杭电公开赛(非原创)
题意:
通过 p的值判断,若p为素数,就断定不是伪素数,若p不是素数,则判断式子(a^n)%p==a;若相等,则输出yes,否则输出no;
由于数据较大,故容易超时,采用分治法求解;
代码:
#include<stdio.h>
int s(__int64 a)
{
int i;
for(i=2;i*i<=a;i++)
if(a%i==0)
return 1;
return 0;
}
__int64 f(__int64 a,__int64 n,__int64 m)
{
__int64 ans;
if(n==0)
return 1;
__int64 x=f(a,n/2,m);
ans=x*x%m;
if(n%2==1)
ans=ans*a%m;
return (__int64)ans;
}
int main(){
__int64 i,j,n,m;
while(scanf("%I64d%I64d",&n,&m))
{
if(n==m&&n==0)
break;
if(!s(n))
printf("no\n");
else if(f(m,n,n)==m)
printf("yes\n");
else printf("no\n");
}
return 0;
}
int s(__int64 a)
{
int i;
for(i=2;i*i<=a;i++)
if(a%i==0)
return 1;
return 0;
}
__int64 f(__int64 a,__int64 n,__int64 m)
{
__int64 ans;
if(n==0)
return 1;
__int64 x=f(a,n/2,m);
ans=x*x%m;
if(n%2==1)
ans=ans*a%m;
return (__int64)ans;
}
int main(){
__int64 i,j,n,m;
while(scanf("%I64d%I64d",&n,&m))
{
if(n==m&&n==0)
break;
if(!s(n))
printf("no\n");
else if(f(m,n,n)==m)
printf("yes\n");
else printf("no\n");
}
return 0;
}
0 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
- 第十二周项目-阅读程序3
- jquery ajax 实现标签容器内的局部刷新
- 找bug的感悟
- 平板开发中ListView的每项选中不变颜色及每项图文并茂的方法之一
- [iOS-GQiang]iOS获取当前时间
- Pseudoprime numbers
- 软件快速计算平方根与平方根的倒数
- HDU 5094 Maze(迷宫搜索)
- CSS垂直翻转/水平翻转提高web页面资源重用性
- 第十二周项目-阅读程序4
- raphaeljs画 svg 图层级问题
- SWT/Jface Final evaluation of JFace project on Google Summer of Code 2014
- 补码表示法
- jQuery在线选座订座(影院篇)