Submission

Score: 80

User: ikky29481

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-05-15 17:07:45

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

vector<int> sieve(int n) {

    vector<bool> prime(n + 1, true);
    for (int p = 2; p * p <= n; p++) {
        if (prime[p] == true) {

            for (int i = p * p; i <= n; i += p)
                prime[i] = false;
        }
    }
    
    vector<int> res;
    for (int p = 2; p <= n; p++){
        if (prime[p]){ 
            res.push_back(p);
        }
    }
    return res;
}
int main(){

    int n;
    cin >> n;
    vector<int> res = sieve(n);
    for(auto ele : res){
        cout << ele <<endl;
    }
    return 0;
}