Submission

Score: 85

User: Neozaawwman1

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

Language: cpp

Time: 0.009 second

Submitted On: 2025-10-10 11:15:50

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

int main() {
    int n;
    cin >> n;
    vector<int> check(n, 0);
    vector<int> prime;

    if (n > 0) check[0] = 1;
    if (n > 1) check[1] = 1;

    for (int i = 2; i * i < n; i++) {
        if (check[i] == 0) {
            for (int j = i * i; j < n; j += i) {
                check[j] = 1;
            }
        }
    }

    for (int i = 2; i < n; i++) {
        if (check[i] == 0) {
            prime.push_back(i);
        }
    }

    int start = max(0, (int)prime.size() - 5);
    for (int i = start; i < prime.size(); i++) {
        cout << prime[i] << " ";
    }

    return 0;
}