Cod sursa(job #2847819)
Utilizator | Data | 11 februarie 2022 15:47:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
//using namespace std;
std::ifstream cin("ciur.in");
std::ofstream cout("ciur.out");
int n, cnt;
char prim[2000005];
int main(){
int i, j;
cin >> n;
for(int i=2; i<=n; i++)
prim[i] = 1;
for(int i=2; i<=n; i++){
if(prim[i]){
cnt++;
for(j = i+i; j<=n; j += i)
prim[j] = 0;
}
}
cout << cnt;
}