Submission

Score: 100

User: Songkran

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-04 21:34:55

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

bool isPrime(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;

    for (int i = 2; i < n; i++){
        if (isPrime(i)){
            cout << i << endl;
        }
    }
    return 0;
}