Cod sursa(job #2570928)
| Utilizator | Data | 4 martie 2020 20:02:58 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
const int nmax=2e6;
bool prim[nmax+5];
int n, cnt;
int main()
{
fi>>n;
for(int i=2; i<=n; i++)
prim[i]=1;
for(int i=2; i*i<=n; i++)
if(prim[i])
for(int j=2; i*j<=n; j++)
prim[i*j]=0;
for(int i=2; i<=n; i++)
if(prim[i])
cnt++;
fo<<cnt;
fi.close();
fo.close();
return 0;
}
