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