Cod sursa(job #842262)
Utilizator | Data | 26 decembrie 2012 15:52:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | 23zile_1 | Marime | 0.39 kb |
#include<fstream>
using namespace std;
int main ()
{
int i,j,n,nr=0;
char ciur[2000001];
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2; i<=n; i++)
{ if (ciur[i]==0)
{ nr++;
for (j=i+i; j<=n; j=j+i)
ciur[j]=1; } }
g<<nr;
f.close();
g.close();
return 0;
}