Submission

Score: 100

User: mumumimi

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-10-02 01:08:48

#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;
    if(n%2==0) return false;
    for(ll i=3;i<=sqrt(n);i+=2){
        if(n%i==0) return false;
    }
    return true;
}
int main(){
    ios_base::sync_with_stdio(0),cin.tie(nullptr);
    ll n;cin >> n;
    vector<ll> v;
    while(true){
        n--;
        if(isprime(n)) v.push_back(n);
        if(v.size()==5) break;
    }
    sort(v.begin(),v.end());
    for(int i=0;i<v.size();i++){
        cout << v[i] << " ";
    }
    return 0;
}