Cod sursa(job #303450)
Utilizator | Data | 9 aprilie 2009 20:56:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
char prim[2000001];
long nr=0,i,n,j;
int main()
{
ifstream f("ciur.in");
f>>n;
f.close();
for(i=2;i<=n;i++)
prim[i]=0;
for(i=2;i<=n;i++)
if(prim[i])
{nr++;
for(j=i+i;j<=n;j=j+i)
prim[i]=0;}
ofstream g("ciur.out");
g<<nr;
g.close();
return 0;
}