Cod sursa(job #2843090)
Utilizator | Data | 1 februarie 2022 22:49:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
#define MAX 2000000
int ciur[MAX];
int main(void){
ofstream cout("ciur.out");
ifstream cin("ciur.in");
int n;
cin >> n;
for(int i =2;i<MAX;i++){
if(ciur[i]==0){
for(int j=2;j*i<MAX;j++){
ciur[i*j] = 1;
}
}
}
int cnt = 0;
for(int i =2;i<=n;i++){
if(ciur[i] == 0)++cnt;
}
cout << cnt;
}