Cod sursa(job #3123210)
Utilizator | Data | 22 aprilie 2023 14:20:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool erath[2000005];
int main()
{ int n;
fin>>n;
for(int div=2; div*div<=n; div++){
if(erath[div]==true){
continue;
}
for(int nr=2*div; nr<=n; nr+=div){
erath[nr]=true;
}
}
int cnt=0;
for(int i=2; i<=n; i++)
if(!erath[i])
cnt++;
fout<<cnt;
return 0;
}