Submission

Score: 100

User: bestisyis...programming

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

Language: cpp

Time: 0.005 second

Submitted On: 2026-10-06 13:48:34

#include <iostream>
#include <cmath>
using namespace std;

bool isprime(int x){
	if(x==2) return true;
	else{
		for(int i=3;i<=sqrt(x);i++)
			if(x%i==0) return false;
		return true;
	}
}

int main(){
	int n;
	cin >> n;
	for(int i=2;i<n;i+=2){
		if(isprime(i)) cout << i <<endl;
		if(i==2) i=1;
	}
}