0x31 质数

poj2689 算根号R的质数，然后把L~R区间（这个很小啊）的合数判下

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long LL;

int pr,prime[];bool v[];
void get_prime(int li)
{
    pr=;memset(v,false,sizeof(v));
    for(int i=;i<=li;i++)
    {
        if(v[i]==false)prime[++pr]=i;
        for(int j=;j<=pr&&i*prime[j]<=li;j++)
        {
            v[i*prime[j]]=true;
            if(i%prime[j]==)break;
        }
    }
}

int blen,bprime[];
int main()
{
    int L,R;
    while(scanf("%d%d",&L,&R)!=EOF)
    {
        if(L==)L++;
        get_prime( (int(sqrt(double(R)))) );
        memset(v,false,sizeof(v));
        for(int j=;j<=pr;j++)
        {
            LL d=L%prime[j]==?L:((LL)prime[j])*((LL)(L/prime[j]+));
            if(d==prime[j])d+=prime[j];
            while(d<=R)
            {
                v[d-L+]=true;
                d+=prime[j];
            }
        }
        blen=;
        for(int i=;i<=R-L+;i++)
            if(v[i]==false)bprime[++blen]=i;
        if(blen<=)printf("There are no adjacent primes.\n");
        else
        {
            int mx1=-,mx2,mn1=-,mn2;
            for(int i=;i<blen;i++)
            {
                if(mx1==-||mx2-mx1<bprime[i+]-bprime[i])
                    mx1=bprime[i], mx2=bprime[i+];

                if(mn1==-||mn2-mn1>bprime[i+]-bprime[i])
                    mn1=bprime[i], mn2=bprime[i+];
            }
            mx1+=L-, mx2+=L-, mn1+=L-, mn2+=L-;
            printf("%d,%d are closest, %d,%d are most distant.\n",mn1,mn2,mx1,mx2);
        }
    }
    return ;
}

poj2689

阶乘分解 筛素数然后看每个素数的贡献啊。

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long LL;

int pr,prime[];bool v[];
void get_prime(int li)
{
    pr=;memset(v,false,sizeof(v));
    for(int i=;i<=li;i++)
    {
        if(v[i]==false)prime[++pr]=i;
        for(int j=;j<=pr&&i*prime[j]<=li;j++)
        {
            v[i*prime[j]]=true;
            if(i%prime[j]==)break;
        }
    }
}

int main()
{
    int n;
    scanf("%d",&n);
    get_prime(n);

    for(int j=;j<=pr;j++)
    {
        printf("%d ",prime[j]);
        LL k=prime[j];int c=;
        while(k<=n)
        {
            c+=n/k;
            k*=prime[j];
        }
        printf("%d\n",c);
    }
    return ;
}

阶乘分解