Cod sursa(job #345634)
Utilizator | Data | 3 septembrie 2009 21:20:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream.h>
#include<iostream.h>
main()
{
long n,i,j,k=0,a[10000];
ifstream f("ciur.in",ios::in);
ofstream g("ciur.out",ios::out);
f>>n;
for(i=2; i<=n; i++)
a[i]=1;
for(i=2; i*i<=n; i++)
if(a[i]==1)
for(j=2; i*j<=n; j++)
a[i*j]=0;
for(i=2; i<=n; i++)
if(a[i]==1)k++;
g<<k;
f.close();
g.close();
return 0;
}