codevs——1436 孪生素数 2

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define N 6000
using namespace std;
bool not_prime[N];
int n,m,ans,sum,tot,prime[N];
int read()
{
    int x=0,f=1; char ch=getchar();
    while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘) f=-1; ch=getchar();}
    while(ch>=‘0‘&&ch<=‘9‘) {x=x*10+ch-‘0‘; ch=getchar();}
    return x*f;
}
void Euler_sieve()
{
    memset(not_prime,0,sizeof(not_prime));
    
    for(int i=2;i<=n;i++)
    {
        if(!not_prime[i]) prime[++tot]=i;
        for(int j=1;j<=tot;j++)
        {
            if(i*prime[j]>n) break;
            not_prime[i*prime[j]]=1;
            if(i%prime[j]==0) break;    
        }    
    }  
}
int main()
{
    n=read(),m=read();
    Euler_sieve();not_prime[1]=1;
    for(int i=1;i<=n-m;i++)
      if(!not_prime[i]&&!not_prime[i+m])
       printf("%d %d\n",i,i+m),sum++;
    printf("Total Is:%d",sum);
    return 0;
}