Cod sursa(job #409807)
Utilizator | Data | 3 martie 2010 21:21:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream.h>
using namespace std;
char x[2500000];
int main()
{ ifstream f("ciur.in"); ofstream g("ciur.out");
int n,nr=0,i,j=2; bool stop=0;
f>>n;
for(i=2;i<=n;i++)
{ if(x[i]==0)
for(j=2*i;j<=n;j+=i)
x[j]=1;
}
for(i=2;i<=n;i++)
if(x[i]==0)
nr++;
g<<nr;
f.close(); g.close();
return 0;
}