Cod sursa(job #383085)
Utilizator | Data | 15 ianuarie 2010 17:07:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include <fstream>
using namespace std;
fstream f ("ciur.in");
ofstream g ("ciur. out");
char a[2000000];
int n,i,j,nr;
int main ()
{f>>n;
for (i=2;i<=n;i++)
{ if (a[i]==0)
nr++;
for (j=2;j<=n/i;j++)
a[i*j]=1;
}
g<<nr;
return 0;
}