传送门:Prime Judge
Prime Judge
Source : Unknown | |||
Time limit : 30 sec | Memory limit : 32 M |
Submitted : 5899, Accepted : 879
Given a positive integer, your job is writing a program to determine whether it is a prime number or not.
Input
There are several tests. Each test consists of a positive integer n(no more than 2^31) on a single line. Input is terminated by end of file.
Output
For each integer in the input, print a "YES" if it is a prime number, otherwise print a "NO" instead.
Sample Input
4 5 6Sample Output
NO YES NO
解题报告:
费尔马小定理,如果 n 为素数,那么对于小于n的数a有a^(n-1) = 1(mod n)
那么我们可以随机生成一个a(a<n),如果满足a^(n-1) = 1(mod n),那么n就有可能是质数。随机生成三次,即验证三次,那么这个概率就非常大。
关于a^b%n,用快速幂来解
代码如下:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
long long pow_mod(long long a,long long b,long long n){
long long res=1;
while(b){
if(b&1) res=res*a%n;
a=a*a%n;
b>>=1;
}
return res;
}
bool Miller_Rabbin(long long n){
//费尔马小定理,如果 n 为素数,那么对于小于n的数a有a^(n-1) = 1(mod n)
long long a = rand()%(n-1)+1;//随机生成一个小于n的数
//a^(n-1) = 1(mod n)
if(pow_mod(a,n-1,n)!=1){
return false;
}
return true;
}
int main(){
long long n;
while(scanf("%lld",&n)==1) {
int flag = 1;//1表示素数
int times = 3;//times为每个数进行测试的次数
if(n<=1)
flag = 0;
else if(n==2||n==3)
flag = 1;
else{
while(times--&&flag){
if(!Miller_Rabbin(n))
flag = 0;
}
}
if(!flag)
printf("NO\n");
else
printf("YES\n");
}
return 0;
}