Cod sursa(job #2450929)
Utilizator | Data | 24 august 2019 23:36:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#define MAXN 2000001
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool prim[MAXN];
int main(){
int n,nrprime=0;
fin>>n;
prim[0]=prim[1]=1;
for(int i=2;i<=n;i++){
if(prim[i]==0){
nrprime++;
for(int d=2;d*i<=n;d++){
prim[d*i]=1;
}
}
}
fout<<nrprime;
return 0;
}