Submission

Score: 80

User: sakuragichan

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

Language: cpp

Time: 0.005 second

Submitted On: 2026-09-03 15:44:21

#include <iostream>
#include <vector>
using namespace std;
void findprime(int n) {
    vector<bool> isprime(n+1,true);
    isprime[0] = false;
    isprime[1] = false;
    for (int i = 2 ; i * i <= n; i++) {
        if (isprime[i]) {
            for (int p = i*i ; p <= n; p+=i) {
                isprime[p] = false;
            }
        }
    }
    for (int j = 2 ; j <= n; j++) {
        if (isprime[j]) {
            cout << j << endl;
        }
    }
}


int main() {
  int n;
  cin >> n;
  findprime(n);
  return 0;
}