Cod sursa(job #159835)
Utilizator | Data | 14 martie 2008 14:13:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
unsigned long v[2005];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
long i,n,j,k,l,m,cnt=0;
f>>n;
for(i=1;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i])
{
cnt++;
for(j=i+i;j<=n;j+=i)
{
v[j]=0;
}
}
/* for(i=2;i<=n;i++)
{
if(v[i]==1)g<<i<<" ";
}
*/
g<<cnt;
f.close();
g.close();
return 0;
}