Submission

Score: 80

User: Folk_DIWA

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

Language: cpp

Time: 0.003 second

Submitted On: 2026-10-11 16:24:10

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

using ll = long long;

vector <int> prime(105,1);

void sieve(int n){

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

}

int main(){
    cin.tie(0)->sync_with_stdio(0);

    int n; cin >> n;
    sieve(n);

    for(int i=2; i<=n; i++){
        if(prime[i]) cout << i << '\n';
    }

    return 0;
}