Submission

Score: 100

User: Bermmmm

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

Language: cpp

Time: 0.086 second

Submitted On: 2025-10-07 09:20:04

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

bool checkprime(int a) {
    if (a<2) {
        return false;
    }
    for (int j=2;j < a;++j) {
        if (a%j == 0) {
            return false;
        }
    }
    return true;
}


int main() {
    int n,count;
    count =0;
    vector<int> prime;

    cin >> n;
    for (int i=n;i>=1;i--) {
        if (checkprime(i) == true && i != n) {
            prime.push_back(i);
            count++;
        }
        if (count == 5)  {
            break;
        }
    }

    reverse(prime.begin(),prime.end());

    for (int k=0;k<5;k++) {
        cout << prime[k] << ' ';
    }
}