Submission

Score: 100

User: angpangSK

Problemset: จำนวนเฉพาะก่อนหน้า

Language: c

Time: 0.002 second

Submitted On: 2025-09-24 21:51:30

#include <stdio.h>

int isPrime(int x) {
    if (x < 2) return 0;
    for (int i = 2; i * i <= x; i++) {
        if (x % i == 0) return 0;
    }
    return 1;
}

int main() {
    int N;
    scanf("%d", &N);

    int primes[5];
    int count = 0;
    int num = N - 1;

    while (count < 5) {
        if (isPrime(num)) {
            primes[count] = num;
            count++;
        }
        num--;
    }

    for (int i = 4; i >= 0; i--) {
        printf("%d ", primes[i]);
    }
    printf("\n");

    return 0;
}