Submission

Score: 80

User: tl.cpp

Problemset: จำนวนเฉพาะ (2560)

Language: cpp

Time: 0.006 second

Submitted On: 2026-07-31 13:38:55

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 8e5 + 5;
int n, isPrime[N];
int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    cin >> n;
    for (int i = 2; i < N; i++) {
        if (!isPrime[i]) {
            for (int j = i * 2; j < N; j += i) {
                isPrime[j] = 1;
            }
        }
    }
    for (int i = 2; i <= n; i++) {
        if (!isPrime[i]) cout << i << '\n';
    }
}