spoj Prime Generator

题意：判断ll-rr范围内的质数。

一个个用miller-rabin算法判断

//#pragma comment(linker,"/STACK:1024000000,1024000000") 
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include <stack>
using namespace std;
typedef long long lon;
const lon SZ=1000010,INF=0x7FFFFFFF;

lon pow(lon x,lon n,lon mod)
{
    lon res=1,ele=x;
    for(;n;)
    {
        if(n&1)res=ele*res%mod;
        ele=ele*ele%mod;
        n/=2;
    }
    return res;
}

bool isp(lon x)
{
    if(x==1)return 0;
    int sz=3;
    lon arr[sz]={2,7,61};
    for(lon i=0;i<sz;++i)
    {
        if(x==arr[i])return 1;
        lon id=x-1;
        for(;!(id&1)&&id;id/=2);
        lon m=pow(arr[i],id,x);
        if(m==1)continue;
        for(;id!=x-1&&m!=1;)
        {    
            //if(x==5)cout<<m<<endl;
            if(m==x-1)break;
            m=m*m%x;
            //if(m!=1&&m!=x-1)return 0;
            id*=2;
        }
        if(m!=x-1)return 0;
    }
    return 1;
}

int main()
{
    std::ios::sync_with_stdio(0);
    //freopen("d:\\1.txt","w",stdout); 
    lon casenum;
    cin>>casenum;
    for(lon time=1;time<=casenum;++time)
    //for(;scanf("%d",&n)!=EOF;)
    {
        lon ll,rr;
        cin>>ll>>rr;
        for(lon i=ll;i<=rr;++i)
        {
            if(isp(i))cout<<i<<endl;
        }
        cout<<endl;
    }
    return 0;
}

 

转载于:https://www.cnblogs.com/gaudar/p/9751509.html