Submission

Score: 100

User: Alif_Sama

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-10 06:40:53

#include <iostream>
#include <cmath>
using namespace std;

int main() {
    int n;
    cin >> n;
    int primecnt = 0;
    bool prime = true;
    int res[5] = {0};
    for(int i = n-1; i >= 0; i--) {
        // Find primes
        for(int j = 2; j * j <= i; j++) {
            if (i % j == 0) {
                prime = false;
                break;
            }
        }
        if (prime) {
            res[primecnt] = i;
            primecnt += 1;
        }
        prime = true;
        if (primecnt == 5) {
            break;
        }
    }
    for (int i = 4; i >= 0; i--) {
        cout << res[i] << " ";
    }
}