Submission

Status:

PPPPPP-PP-

Subtask/Task Score:

80/100

Score: 80

User: rice_ot

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-14 08:57:13

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n; cin>>n;
    vector<bool> isPrime(n+1, true);
    isPrime[0] = false;
    isPrime[1] = false;

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

    }
    for(int i = 0; i<=n; i++){
        if(isPrime[i]) cout<<i<<"\n";
    }
}