是多少

Posted 2021-01-05 bhd123

#include <iostream>
#include<cstdio>
using namespace std;
int p[1000000];
int a[1000000];
int main()
{
    int l,r;
    for(i=2;i<=1000000;i++)
    {
        if(p[i]==0)
        {
            a[t++]=i;
            for(j=i+i;j<=1000000;j+=i)
                p[j]=1;
        }
    }
    while(~scanf("%d%d",&l,&r))
    {
        for(i=0;i<=t-1;i++)
        {
            if(p[i]>=l&&p[i]<=r)
            {
                ll=i;
                break;
            }
        }
        if(i==t-1)
        {
            printf("There are no adjacent primes. ");
            return 0;
        }
        rr=ll;
        for(j=i;j<=t-1;j++)
        {
            if(p[j]<=r)
                rr=j;
        }
        if(rr==ll)
        {
            printf("%d,%d are closest, %d,%d are most distant.",rr,rr,rr,rr);
            return 0;
        }
        for(i=0;i<=jj;i++)
        {
            
        }
    }
}