Submission

Status:

PPPPPPPPPPPPPPPPPPPP

Score: 100

User: NJTYTYTY

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-03-07 06:16:04

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

bool isprime(int n) {
    if(n == 2) return true;

    for(int i = 2; i * i <= n ; ++i) {
        if(n % i == 0) return false;
    }
    return true;
}

int main() {
    int n; cin >> n;
    vector<int> ans; 
    for(int i = n-1 ; i>= 2 && (ans.size() <5 ) ; --i) {
        if(isprime(i)) {
            ans.push_back(i);
        }
        reverse(ans.begin() , ans.end());
        
    }
    for(auto e : ans) cout << e << ' ';


    return 0;
}