Submission

Score: 80

User: kenmuay

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-12 18:18:08

#include <bits/stdc++.h>
using namespace std;
bool check[110];
void prime(int x){
    for(int i=2; i<=sqrt(x); i++){
        if(check[i] == 0) continue;
        for(int j=i*i; j<=x; j++){
            if(j%i==0) check[j]=false;
        }
    }
}

int main(){
    int n;
    cin >> n;
    fill(check,check+110,true);
    check[0] = 0;
    check[1] = 0;
    prime(n);
    for(int i=0; i<=n; i++){
        if(check[i] == 1) cout << i << endl;
    }
    return 0;
}