Submission

Score: 60

User: Nitro_Legacy

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

Language: cpp

Time: 0.233 second

Submitted On: 2026-09-27 17:28:00

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> sieve(ll 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> v;
    for (ll i = 2; i <= n; i++){
        if (prime[i]){
            v.push_back(i);
        }
    }
    return v;
}
int main(){
    ll n;
    cin >> n;
    vector<ll> v = sieve(10 * n);
    
    for (ll i = 0; i <= n + 1; i++){
        if (v[i] >= n){
            cout << v[i - 5] << " " << v[i - 4] << " " << v[i - 3] << " " << v[i - 2] << " " << v[i - 1];
            return 0;
        }
    }
}