Submission

Score: 100

User: The3e

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-09-10 19:50:58

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

int main() {
    int N;
    cin >> N;
    
    vector<int> prime;
    
    // int prime[5];
    // int found = 0;
    
    for (int x = N-1; x >= 2 && prime.size() < 5; x--) {
        bool pnum = true;
        for (int i = 2; i*i<=x; i++) {
            if (x % i == 0) {
                pnum = false;
                break;
             }
            }
            if (pnum) {
                prime.push_back(x);
                // prime[found] = x;
                // found++;
        }
    }
    for (int i = 4; i >= 0; i--) {
        cout << prime[i] << " ";
    }
    return 0;
}