Cod sursa(job #2969618)

Utilizator MkA1Mihai MkA1 MkA1 Data 23 ianuarie 2023 14:37:57
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.4 kb
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 9;
bool ciur [maxn];
	
int main(){
	freopen ("ciur.in" , "r", stdin);
	freopen("ciur.out" , "w", stdout);
	int n;
	cin >>n;
	ciur[0] = ciur[1] = true;
	int rs = 0;
	for(int i = 2; i <= n; i++){
		if(ciur[i] == false){
			rs++;
			for(int j = i * 2; j <= n; j+=i){
				ciur[j] = true;
			}
		}
	}
	cout << rs;
	return 0;
}