Submission

Score: 90

User: NovemNotes

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

Language: cpp

Time: 0.049 second

Submitted On: 2025-10-15 18:50:04

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

#define int long long

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int n;cin >> n;
    vector<bool> prime(n+9,true);
    prime[0]=prime[1]=false;
    deque<int> ans;
    for(int i=2;i<=n;i++){
        if(!prime[i])continue;
        ans.push_back(i);
        if(ans.size()>5)ans.pop_front();
        for(int j=i*i;j<=n;j+=i){
            prime[j]=false;
        }
    }
    while(!ans.empty()){
        cout << ans.front() << " ";
        ans.pop_front();
    }
    return 0;
}