Submission

Score: 90

User: Kidmaiok

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-07 08:57:15

#include<bits/stdc++.h>
using namespace std;
//check 5 prime number before n
bool isitprime(int x){
    if(x < 2) return false;
    for(int i = 2;i*i<=x;i++){
        if(x%i == 0){
            return false;
        }       
    }return true;

}

int main(){
    cin.tie(NULL)->sync_with_stdio(false);
    int n;
    vector<int> number;
    cin >> n;
    for(int i = n;i>=2 && number.size()<5;i--){
        if(isitprime(i)){
            number.push_back(i);
        }
    }
    sort(number.begin(),number.end());
    for(int i = 0;i<number.size();i++){
        cout << number[i] << ' ';
    }

    
    


}