Submission

Score: 75

User: helloskibidi

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

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-06 11:11:50

#include <bits/stdc++.h>
using namespace std;

const int MAX = 1100000;
bool composite[MAX + 1];

int main(){
    int n; cin >> n;

    composite[0] = composite[1] = true;

    for(int i = 2; (long long)i * i <= MAX; i++){
        if(!composite[i]){
            for(int j = i * i; j <= MAX; j += i){
                composite[j] = true;
            }
        }
    }

    vector<int> x;
    for(int i = n - 1; i >= 2 && x.size() < 5; i--){
        if(!composite[i]){
            x.push_back(i);
        }
    }
    sort(x.begin() , x.end());
    for(int p : x) cout << p << ' ';
    cout << '\n';
}