Cod sursa(job #288364)
Utilizator | Data | 25 martie 2009 19:02:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
unsigned long d,i,n,ok,ciur;
unsigned long PRIM(unsigned long);
main()
{
ifstream In("ciur.in");
ofstream Out("ciur.out");
In>>n;
In.close();
for(;i<n;i++)
{
if(PRIM(i)) ciur++;
}
Out<<ciur<<'\n';
Out.close();
return 0;
}
unsigned long PRIM(unsigned long x)
{
ok=1;
for(d=2;d<=7;d++)
if(x%d==0) ok=0;
return ok;
}