hdu 2138 How many prime numbers (随即素数测试模版)
来源:互联网 发布:oa免费办公软件 编辑:程序博客网 时间:2024/06/10 23:46
#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
using namespace std;
long long bigpow(long long x,long long n, long long M){
long long res=1,temp=x%M;
while(n){
if(n&1){
res=(res*temp)%M;
}
temp=(temp*temp)%M;
n>>=1;
}
return res;
}
long long miller(long long n, long long s=50){
if(n==2)return 1;
if(n%2==0)return 0;
long long j, a;
for(j=0; j<s; j++){
a=rand()*(n-2)/RAND_MAX+1;
if(bigpow(a, n-1, n)!=1)return 0;
}
return 1;
}
int main(){
int T, ans;
long long n;
while(scanf("%d", &T)!=EOF){
ans=0;
while(T--){
scanf("%I64d", &n);
if(miller(n))
ans++;
}
printf("%d\n", ans);
}
return 0;
}
- hdu 2138 How many prime numbers (随即素数测试模版)
- HDu 2138 How many prime numbers 高效Miller素数测试
- hdu 2138 How many prime numbers(求素数)
- hdu 2138 How many prime numbers (素数判定)
- HDU 2138 How many prime numbers(米勒拉宾素数测试算法)
- HDU-2138-How many prime numbers(米勒拉宾素数测试)
- hdu2138 How many prime numbers (素数测试)
- hdu 2138 How many prime numbers(数论:素数判定)
- hdu 2138 How many prime numbers 大规模素数判断
- HDU 2138 How many prime numbers【素数判断,卡时间!!】
- HDU 2138 How many prime numbers(大数字素数判定)
- hdu2138 How many prime numbers(Miller_Rabbin随机素数测试)
- HDU-2138 How many prime numbers
- hdu 2138 How many prime numbers(miller_rabin?)
- HDU 2138 How many prime numbers
- HDU 2138 How many prime numbers
- hdu 2138 How many prime numbers
- hdu 2138 How many prime numbers
- 获取Spinner当前显示的文本内容
- 一步一步实现用c#编写异步socket服务端监听程序
- Hadoop0.20.203.0在关机重启后,namenode启动报错(/dfs/name is in an inconsistent state)
- INSERT All/ INSERT FIRST 小实验
- 2012校招之我的求职之路(上)
- hdu 2138 How many prime numbers (随即素数测试模版)
- VC6中将一个工程中的对话框添加到另外一个工程
- Nutch1.3和Hadoop0.20.203.0的整合
- 获取某service是否在运行
- When Linux kernel panic, what can we do ?
- JAVA中观察者模式示例
- 代码签名证书FAQ
- MultiByteToWideChar和WideCharToMultiByte用法详解 .
- 将点分式的IP地址转换成长整型