Submission
Status:
PPPPPP-PP-
Subtask/Task Score:
80/100
Score: 80
User: Hax
Problemset: จำนวนเฉพาะ (2560)
Language: cpp
Time: 0.005 second
Submitted On: 2026-10-12 16:47:16
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int count = 0;
cin >> n;
int list[15] = {};
for (int i = 2; i <= n; i ++) {
bool isPrime = true;
for (int j = 2; j * j <= i; j ++) {
if (i % j == 0) {
isPrime = false;
break;
}
}
if (isPrime){
list[count] = i;
count ++;
}
}
for (int i = 0; i < count; i++) {
cout << list[i] << endl;
}
}