Submission

Score: 80

User: TeyJee

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-13 15:51:58

#include <iostream>
#include <cmath>
using namespace std;
bool isPrime(int n){
	if(n==1){
		return 0;
	}else if(n==2){
		return 1;
	}else if(n%2==0){
		return 0;
	}else{
		for(int i=3;i<int(sqrt(n))+1;i+=2){
			if(n%i==0){
				return 0;
			}
		}
	}
	return 1;
}
int main(){
	int cnt;
	cin>>cnt;
	for(int i=2;i<=cnt;i++){
		if(isPrime(i)==1){
			cout<<i<<"\n";
		}
	}
	return 0;
}