Submission

Score: 0

User: august

Problemset: Twin, Cousin, and Sexy Prime

Language: c

Time: 0.001 second

Submitted On: 2025-10-09 23:44:41

#include <stdio.h>

int p[70000001]={};


int main() {
    int l, r;
    scanf("%d %d", &l, &r);
    int t=0,c=0,s=0;
    
    for (int i=2; i<=35000000; i++) {
        if (p[i])continue;
        for (int j=2; j*i <=35000000; j++) {
            p[j*i]=1;
        }
    }

    int a[r-l+1];
    for (int i=l; i<=r; i++) {
        if (p[i])continue;
        if ((i-2 >= 2 && p[i-2]==0) || p[i+2]==0) t++;
        if ((i-4 >= 2 && p[i-4]==0) || p[i+4]==0) c++;
        if ((i-6 >= 2 && p[i-6]==0) || p[i+6]==0) s++;
    }
    printf("%d\n%d\n%d", t,c,s);
}