素数筛法

http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=8252#problem/E

思路：对于小于10^7的数可以直接筛，对于10^7 - 10^8之间的数可以枚举小于1w的素数筛，然后存起来，主意这有个空间优化，不然会超内存。

#include<map>
#include<set>
#include<list>
#include<queue>
#include<cmath>
#include<stack>
#include<cstdio>
#include<cctype>
#include<vector>
#include<string>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;
#define lowbit(x) (x&(-x))
#define CC(a,b) memset(a,b,sizeof(a))
#define inf 0x7fffffff
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define maxn 10000001
#define LL __int64
#define ULL unsigned __int64
#define UI unsigned int
#define L(x) (x<<1)
#define R(x) (x<<1|1)
#define SQR(x) ((x)*(x))
#define mod 1000000007
#define fuck puts("fuck")
const double eps=1e-6;
const double pi=acos(-1.0);
//5761455
bool hh[maxn];
int idx,prime[5761460];
UI prime_mul[5761460];
void init()
{
    idx=0;
    CC(hh,0);
    for(int i=2;i<maxn;i++)
        if(!hh[i])
        {
            prime[idx++]=i;
            for(int j=i+i;j<maxn;j+=i)
                hh[j]=1;
        }
    for(int i=1;i<10;i++)
    {
        int temp=i*10000000+1;
        int lim=(i+1)*10000000;
        CC(hh,0);
        for(int j=0;prime[j]<=10000;j++)
        {
            int k=temp/prime[j];
            if(temp%prime[j]) k++;
            //if(k==1) k++;
            for(;k*prime[j]<=lim;k++)
                hh[k*prime[j]-temp]=1;
        }
        for(int j=temp;j<=lim;j++)
            if(!hh[j-temp])
                prime[idx++]=j;
    }
    //cout<<prime[1229]<<endl;
    //cout<<idx<<endl;
    //1229  prime[1229]=10007;
    prime_mul[1229]=10007;
    for(int i=1230;i<idx;i++)
        prime_mul[i]=prime_mul[i-1]*(UI)prime[i];
   
}
UI quickf(UI n,int m)
{
    UI ans=1;
    for(;m;m>>=1)
    {
        if(m&1) ans*=n;
        n*=n;
    }
    return ans;
}
int find(int num)
{
    int ans;
    int left=0,right=idx-1;
    while(left<=right)
    {
        int mid=(left+right)>>1;
        if(prime[mid]<=num)
        {
            ans=mid;
            left=mid+1;
        }
        else
            right=mid-1;
    }
    return ans;
}
void solve(int n)
{
    UI ans=1;
    int i;
    for(i=0;i<idx && prime[i]<=10000 && prime[i]<=n ;i++)
    {
        int cnt=0;
        LL temp=1;
        while(temp<=n)
        {
            cnt++;
            temp*=prime[i];
        }
        cnt--;
        ans*=quickf(prime[i],cnt);
    }
    if(i==1229 && prime[i]<=n)
    {
        int j=find(n);
        ans*=prime_mul[j];
    }
    cout<<ans<<endl;
}
int main()
{
    init();
    int t,cas=1;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d",&n);
        printf("Case %d: ",cas++);
        solve(n);
    }
}