Submission

Score: 0

User: black_guy001

Problemset: บวกเลขฐาน

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-20 09:21:36

#include <bits/stdc++.h>
using namespace std;
vector<bool> prime;
bool checkprime(int n){
    if(n < 2) return false;
    for(int i = 2; i * i <= n; i++){
        if(n % i == 0) return false;
    }
    return true;
}
int main(){
    int n;
    cin >> n;
    prime.resize(n);
    for(int i=0;i<n;i++){
        prime[i]=checkprime(i);
        if (prime[i]) cout << i << endl;
    }

}