paste bin

malic
C++
Xp4f
#include <cstdio>
#include <cstring>

#define MAXN 10007

char isPrime[MAXN];
void init()
{
    memset(isPrime,1,sizeof(isPrime));
    isPrime[0]=0;
    isPrime[1]=0;
    int i,j;
    for(i=2;i*i<=MAXN;i++)
    {
        if(isPrime[i]==0)
            continue;
        for(j=i*i;j<MAXN;j+=i)
            isPrime[j]=0;
    }
    return ; 
}

int mirror(int x)
{
    int r=0;
    while (x>0)
    {
        r=r*10+x%10;
        x/=10;
    }
    return r;
}

int main(void)
{
    init();
    int i,lwbd,upbd,r;
    scanf("%d%d",&lwbd,&upbd);
    int counter=0;
    for(i=lwbd;i<=upbd;i++)
    {
        r=mirror(i);
        if(isPrime[i] && isPrime[r])
            counter+=1;
    }
    printf("%d\n",counter);
    return 0;
}

2020 C1QC

fork this code