Cod sursa(job #2127040)
Utilizator | Data | 10 februarie 2018 11:38:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int N, cnt;
bool prim[2000005];
int main(){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin >> N;
for(int i = 2; i <= N; i++)
prim[i]=1;
for(int i = 2; i <= N; i++){
if(prim[i]){
cnt++;
for(int j = i+i; j <= N; j+=i){
prim[j]=0;
}
}
}
fout << cnt;
return 0;
}