Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: blaboo123
Problemset: จำนวนเฉพาะ (2560)
Language: cpp
Time: 0.002 second
Submitted On: 2025-11-26 22:11:08
#include <iostream>
using namespace std;
int main()
{
long n;
bool isPrime;
cin >> n;
for (int i = 2; i < n; i++)
{
isPrime = true;
for (int j = 2; j * j <= i; j++)
{
if (i % j == 0)
{
isPrime = false;
}
}
if (isPrime)
{
cout << i << endl;
}
}
return 0;
}