Cod sursa(job #538213)
Utilizator | Data | 20 februarie 2011 21:38:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.31 kb |
#include<iostream.h>
#include<fstream.h>
int main()
{char x[20000];
int n,i,j,nr=0;
ifstream f("ciur.in");
f>>n;
f.close();
for(i=2;i<=n;i++)
x[i]=1;
for(i=2;i<=n;i++)
if(x[i]==1) {nr++;
for(j=i+i;j<=n;j=j+i)
x[j]=0;
}
ofstream g("ciur.out");
g<<nr;
g.close();
return 0;
}