Submission

Score: 60

User: nemuchannnUwU

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-14 20:41:53

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n;
vector<bool> isprime(n+1,true);
void s(){
	isprime[0]=isprime[1]=false;
	for (ll i=2;i*i<=n;i++){
		if (isprime[i]){
			for (ll j=i*i;j<=n;j+=i){
				isprime[j]=false;
			}
		}
	}
}

int main(){
	cin.tie(nullptr)->sync_with_stdio(0);
	cin >> n;
	s();
	for (ll i=2;i<n;i++){
		if (isprime[i]) cout << i << "\n";
	}
}