Submission

Score: 90

User: Nopanat-Boon

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

Language: cpp

Time: 1.046 second

Submitted On: 2026-01-04 08:34:30

#include <iostream>
#include <string>
#include <iomanip>
#include <algorithm>
#include <set>
#include <cmath>
#include <vector>
using namespace std;
bool check_prime (int n){
    int cnt = 0;
    for(int i=1;i<=n;i++){
        if(n % i == 0){
            cnt += 1;
        }
    }
    if(cnt == 2){
        return true;
    }
    else{
        return false;
    }

}


int main (){
    int n;
    cin >> n;
    int a[5];
    int cnt = 0;
    for(int i=n-1;cnt < 5;i--){
        if(check_prime(i) == true){
            a[cnt] = i;
            cnt += 1;
        }
    }
    for(int i=4;i>=0;i--){
        cout << a[i] << " ";
    }

}