Submission

Score: 100

User: Nuttykub

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

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-01 21:56:31

#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool isprime(ll n){
    if (n<=1) return false;
    if (n==2) return true;
    for (ll i = 2;i<=sqrt(n);i++){
        if (n%i == 0) return false;
    } 
    return true;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    ll n;
    cin >> n;
    vector<int> vec;
    while(true){
        n--;
        if (isprime(n)) vec.push_back(n);
        if (vec.size() == 5) break;
    }
    sort(vec.begin(),vec.end());
    for (auto p : vec) cout << p << " ";
}