Cod sursa(job #1336415)
| Utilizator | Data | 7 februarie 2015 18:09:26 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char prim[2000005];
int main()
{ int n, i, j, cont=0;
f>>n;
for (i=2;i<=n;++i)
prim[i]=1;
for (i=2;i<=n;++i)
if (prim[i]!=0)
{ ++cont;
for (j=i+i;j<=n;j+=i)
prim[j]=0;
}
g<<cont;
return 0;
}
