Submission

Score: 100

User: Nitro_Legacy

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-11-04 12:29:42

#include <iostream>
#include <cmath>
using namespace std;

bool isPrime(long n) {
    if (n <=1) return false;
    for (long i = 2; i*i <= n; i++) {
        if (n % i == 0)
            return false;
    }
    return true;
}


int main() {
   
   int prime;

 cin>> prime;
  for (int n=1; n<prime; n++){
      if (isPrime(n)){
        cout<< n << endl;
      }
    }
    return 0;
}