Submission

Score: 100

User: nate213121

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

Language: cpp

Time: 0.004 second

Submitted On: 2026-09-17 20:56:19

#include <bits/stdc++.h>

using namespace std;

bool isPrime(int n)
{
    if(n == 2)
    {
        return true;
    }
    for(int i = 2; i <= ceil(sqrt((float)(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;
        }
    }
}