POJ 3641: 伪素数

FATMOUSE.

于 2019-08-03 11:09:21 发布

阅读量199

点赞数 1

分类专栏：题库数论

本文链接：https://blog.csdn.net/qq_45464490/article/details/98312999

版权

题库同时被 2 个专栏收录

17 篇文章 0 订阅

订阅专栏

数论

6 篇文章 0 订阅

订阅专栏

POJ 3641: Pseudoprime numbers

Description
Data
思路
- 伪素数
- - 费马小定理
Code

——伪素数
原题传送门

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 p and a, determine whether or not p is a base-a pseudoprime.

Data

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 2
10 3
341 2
341 3
1105 2
1105 3
0 0
Sample output
no
no
yes
no
yes
yes

2<p≤1000000000 1<a<p

思路

一道关于伪素数的模板题.

伪素数

费马小定理

了解一下
这里不再详细介绍，可以查阅其他博主的资料.?

简单介绍一下思路
对于每一个正整数x:

先判断x是否为质数，是就输出no(Sample 1)
再用快速幂求出k=pow(a,p)%p,判断k是否等于a即可.

//顺便说一下,1105好像是个Carmicheal数.

Code

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define ll long long
using namespace std;
ll a,p;
bool prime(ll x)
{
	if (x==0||x==1) return false;
	for (int i=2;i*i<=x;i++)
		if (x%i==0) return false;
	return true;
}
ll qpow(ll a,ll b,ll p)
{
	ll ans=1;
	while (b>0)
	{
		if (b&1) ans=ans*a%p;
		b>>=1;	
		a=a*a%p;
	} 
	return ans;
}
int main()
{
	while (~scanf("%lld%lld",&p,&a))
	{
		if (p==0||a==0) break;
		if (prime(p))
		{
			printf("no\n");
			continue;
		}
		ll k=qpow(a,p,p);
		if (k==a) printf("yes\n");
		else printf("no\n");
	}
	return 0;
}