Cod sursa(job #157057)
| Utilizator |  Tabacu Raul Consstantin |
Data | 12 martie 2008 20:49:05 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.24 kb |
#include<fstream.h>
int x[2001000],i,j,k,l,m,n;
int main(){
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
{if(x[i]==0)
k++;
for(j=i*2;j<=n;j+=i)
x[j]=1;
}
g<<k;
f.close();
g.close();
return 0;
}