Submission

Status:
PPPPPP-PP-

Score: 80

User: foldnut

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

Language: cpp

Time: 0.003 second

Submitted On: 2024-10-03 13:55:51

#include <iostream>

using namespace std;

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

int main(){
    int n;
    cin >> n;
    for(int i = 2;i<=n;i++){
        if(isPrime(i) == 1){
            cout << i << endl;
        }
    }
}