Submission

Score: 100

User: Apimuk

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-09-22 22:50:26

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


int main()
{
    int n ;
    cin >> n;
    vector<long long>prime;
    for(int i = n-1 ; prime.size() <5 ; i--){
        if(isprime(i)){
            prime.push_back(i);
        }
    }
    sort(prime.begin() , prime.end());
    for(int i = 0 ; i<5 ; i++){
        cout << prime[i] << ' ';
    }

}