Submission

Score: 80

User: chokun

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

Language: cpp

Time: 0.003 second

Submitted On: 2026-10-05 18:57:33

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

void findPrimes(int n){
    vector <bool> isPrime(n+1, true);

    if(n >= 0) isPrime[0] = false;
    if(n >= 1) isPrime[1] = false;

    for (int i = 2; i*i <= n ; i++){
        if(isPrime[i]){
            for (int j = i*i; j <= n ; j+=i){
                isPrime[j] = false;
            }
            
        }
    }

    for (int i = 2; i <= n; i++){
        if(isPrime[i]){
            cout << i << endl;
        }
    }
}

int main(){
    int n;
    cin >> n;

    findPrimes(n);
}