Cod sursa(job #321455)
Utilizator | Data | 6 iunie 2009 13:13:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream.h>
int main()
{
fstream f("ciur.in",ios::in);
fstream g("ciur.out",ios::out);
long int n,i,j,nr,a[10000],s=0;
f>>n;
for(i=1;i<=n;i++)
{
a[i]=1;
}
for(i=2;i<n;i++)
{
if(a[i]==1)
{
s++;
}
for(j=i;j<n;j+=i)
{
a[j]=0;
}
}
g<<s;
f.close();
g.close();
return 0;
}