Submission

Score: 100

User: punzacp555

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

Language: cpp

Time: 0.004 second

Submitted On: 2026-09-30 13:12:28

#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;

    deque<int> ans;

    for(int i=n-1; i>=2; i--) {
        bool isprime = 1;
        for(int j=2; j<=sqrt(i); j++) {
            if(i%j == 0) {
                isprime = 0;
                break;
            }
        }
        if(!isprime) continue;

        if(ans.size() < 5) ans.push_front(i);
        else {
            for(int x : ans) cout << x << ' ';
            return 0;
        }
    }

    return 0;
}