素数判定（费马小定理）

最新推荐文章于 2022-10-26 20:07:04 发布

acmj1991

最新推荐文章于 2022-10-26 20:07:04 发布

阅读量816

点赞数 1

分类专栏： ac小结文章标签：算法

本文链接：https://blog.csdn.net/acmj1991/article/details/6958958

版权

ac小结专栏收录该内容

3 篇文章 0 订阅

订阅专栏

算法原理请看

#include<stdio.h>
#include<string.h>
#include<random>
#include<iostream>
using namespace std;

#define maxN 99
int key[maxN]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103
	,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229
	,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347
	,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463
	,467,479,487,491,499,503,509,521};
long long sq[100];

void init()
{
	sq[0]=1;
	for(int i=1;i<64;i++)
		sq[i]=2*sq[i-1];
}
long long cal(long A,long long M,long long N)
{
	long long k=1; 
	while(M!=1)
	{
		if(M&1)k=(k*A)%N;
		A=(A*A)%N;
		M>>=1;
	}
	return (k*A)%N;
}
bool RabbinMillerTest(long long N)
{
	int psize=maxN-1;
	for(int i=0;i<psize;i++)
	{
		if(N/2+1<=key[i])return true;
		if(N%key[i]==0)return false;
	}
	int M=N-1,R=0;
	while(1){
		if((M&1)==1)break;
		M>>=1;
		R++;
	}
	int T=10;
	for(int l=0;l<10;l++)
	{
		int i,A=key[rand()%psize];
		if(cal(A,M,N)==1)continue;
		for(i=0;i<R;i++){
			if(cal(A,M*sq[i],N)==N-1)break;
		}
		if(i==R)return false;
	}
	return true;
}

int main()
{
	//freopen("1.txt","r",stdin);
	long long m;
	init();
	while(~scanf("%lld",&m))
	{
		printf("%d\n",RabbinMillerTest(m));
	}
}