Submission

Score: 75

User: ChanakanStudy

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

Language: cpp

Time: 0.040 second

Submitted On: 2026-10-11 12:00:04

#include <iostream>
#include <vector>
#include <algorithm>
#define ll long long
using namespace std;


vector<ll> sungorn(int n) {
    vector<bool> prime(n + 1, true);
    for (ll p = 2; p * p <= n; p++) {
        if (prime[p] == true) {
            
            for (ll i = p * p; i <= n; i += p)
                prime[i] = false;
        }
    }
    vector<ll> res;
    for (int p = 2; p <= n; p++){
        if (prime[p]){ 
            res.push_back(p);
        }
    }
    return res;
}

int main(){
    ll n;
    cin >> n;
    vector<ll> res = sungorn(n);
    for(int i = 4 ; i>=0 ;i--) {
        cout << res[res.size() -1 -i ] << " ";
    }
    return 0;
}