Submission

Score: 85

User: Gundhon

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

Language: cpp

Time: 1.090 second

Submitted On: 2026-10-12 19:44:53

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>

using namespace std;

int main(){
    long long x;
    cin >> x;
    vector<long long> p;
    vector<long long> r;


    for(int i = 2; i < x; i++){
        bool prime = true;
        for(int j = 2; j <= sqrt(i); j++){
            if(i % j == 0){
                prime = false;
                break;
            }
        }
        if(prime){
            p.push_back(i);
        }
        
    }
    
    for(int i = p.size()-1; i >= p.size()-5; i--){
        r.push_back(p[i]);
    }

    sort(r.begin(),r.end());

    for(long long x: r) cout << x << " ";

    return 0;
}