Cod sursa(job #418325)
Utilizator | Data | 15 martie 2010 19:20:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
char prim[2000004];
int main()
{ int n;
ifstream fin("ciur.in");
fin>>n;
fin.close();
int i,j,nr=0;
for (i=2;i<=n;++i)
if (!prim[i])
{
++nr;
for (j=i+i; j<=n; j+=i)
prim[j]=1;
}
ofstream fout("ciur.out");
fout<<nr;
fout.close();
return 0;
}