Submission

Score: 0

User: Hxluk.ka

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

Language: cpp

Time: 0.000 second

Submitted On: 2025-10-13 20:59:25

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

int main() {
    int n;
    cin >> n;
    if (n == 0) {cout << 0; return 0;}
    if (n == 1) {cout << 0; return 0;}
    const size_t size = (size_t)n;
    bitset<10000> map;
    map.set();
    for (int i = 2; i < n-1; i++) {
        if (!map[i]) continue;
        for (int j = i+1; j < n; j++) {
            if (j%i == 0) {map[j] = 0;}
        }
    }

    for (int i = 2; i < n; i++) {
        if (map[i]==0) continue;
        cout << i << " ";
    }
}