Submission

Score: 100

User: Nopanat-Boon

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

Language: cpp

Time: 0.044 second

Submitted On: 2026-01-04 09:19:17

#include <iostream>
#include <string>
#include <iomanip>
#include <algorithm>
#include <set>
#include <cmath>
#include <vector>
using namespace std;

void check_prime (vector<bool> &prime){
    for(int i=2;i<prime.size();i++){
        if(prime[i] == false){
            for(int j = 2*i;j<prime.size();j += i){
                prime[j] = true;
            }
        }
    }
}


int main (){
    int n;
    cin >> n;
    int cnt = 0;
    int a[5];
    vector<bool> prime(n+1,false);
    check_prime(prime);
    for(int i=prime.size() - 2;cnt < 5;i--){
        if(prime[i] == false){
            a[cnt] = i;
            cnt += 1;
        }
    }
    for(int i=4;i>=0;i--){
        cout << a[i] << " ";
    }

}