Cod sursa(job #247296)
Utilizator | Data | 22 ianuarie 2009 19:08:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream.h>
int v[2000001];
int n,i,j,s;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++) {
if(v[j]==0) {
s=s+1;
for(j=2*i;j<=n;j+=i) {
v[j]=1;
}
}
}
g<<s;
f.close();
g.close();
system("PAUSE");
return EXIT_SUCCESS;
}