Submission

Score: 100

User: Chayatoeyy

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-06 15:03:39

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

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    long long n;
    cin>>n;
    vector<long long> prime;
    long long x = n-1;
    while((int)prime.size() <5){
        if(isprime((x))){
            prime.push_back(x);
        }
        x--;
    }
    reverse(prime.begin(),prime.end());
    for(int i=0;i<5;i++){
        cout << prime[i] << " ";
    }
}