Submission

Score: 100

User: qweqwe

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-16 19:12:59

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define db long double
#define INF 1e15
using namespace std;

bool isprime(ll n){
    if (n<2) return false;
    for (int i=2;i*i<=n;i++){
        if (n%i==0) return false;
    }return true;
}

int main(){
    ll n;cin >> n;n--;
    ll cnt=0;
    vector<int> lastprimes;
    while (cnt<5){
        bool chk=isprime(n);
        if (chk){
            lastprimes.push_back(n);cnt++;
        }
        n--;
    }
    for (int i=4;i>=0;i--){
        cout << lastprimes[i] << " ";
    }
    return 0;
}