Submission

Score: 100

User: peilin

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

Language: c

Time: 0.002 second

Submitted On: 2025-10-10 22:16:21

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

int isPrime(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 n, count = 0, primes[5];

    scanf("%d", &n);

    for (int i = n - 1; i >= 2 && count < 5; i--) {
        if (isPrime(i)) {
            primes[count++] = i;
        }
    }

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

    return 0;
}