Submission

Score: 0

User: august

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-07 22:36:56

#include <stdio.h>
#include <math.h>

int is_prime(int n) {
    if (n < 2) return 0;
    for (int i=2; i<=sqrt(n); i++) {
        if (n%i==0) {
            return 0;
        }
    }
    return 1;
}

int main() {
    int l, r;
    scanf("%d %d", &l, &r);
    int t=0,c=0,s=0;
    
    for (int i=l; i<=r; i++) {
        if (!is_prime(i)) continue;
        printf("%d\n", i);
        if (is_prime(i-2)==1 || is_prime(i+2)==1) t++;
        if (is_prime(i-4)==1 || is_prime(i+4)==1) c++;
        if (is_prime(i-6)==1 ||is_prime(i+6)==1) s++;
    }
    printf("%d %d %d", t,c,s);
}