Submission

Score: 90

User: nik121416

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

Language: cpp

Time: 0.060 second

Submitted On: 2025-10-10 22:30:34

#include <iostream>
#include <vector>
using namespace std;

int main(){
    long long n,p,count = 0 ,hold[6];
    cin >> n;
    vector<bool> prime(n+1,0);
    for(int i = 2;i<=n;i++){
        if(prime[i]==0){
            p = i;
            for(int j = p+p;j<=n;j+=p){
                prime[j] = 1;
            }
        }
    }
    for(int i = n;i>=2;i--){
        if(count == 6){
            break;
        }
        else{
            if(prime[i] == 0){
                hold[count] = i;
                count +=1;
            }
            else{
                continue;
            }
        }
    }
    for(int i = 4;i>=0;i--){
        cout << hold[i]<< " ";
    }
}