Submission

Score: 100

User: Some1258

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

Language: cpp

Time: 0.051 second

Submitted On: 2026-07-30 08:24:25

#include<bits/stdc++.h>
using namespace std;
int main(){
    long long x;
    cin>>x;
    deque<int> d;
    while(d.size()<5){
        x--;
        bool isPrime=true;
        for(int i=2;i<=(x/2);i++){
            if(x%i==0){
                isPrime=false;
                break;
            }
        }
        if(isPrime){
            d.push_front(x);
        }
    }
    for(int i=0;i<5;i++){
        cout<<d[i]<<' ';
    }
}