Cod sursa(job #159579)
Utilizator | Data | 14 martie 2008 11:28:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include<fstream.h>
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
long n,i,d,k,p=0;
f>>n;
for(i=2;i<=n;i++)
{
k=0;
for(d=2;d<=i/2;d++)
if(i%d==0)k++;
if(k==0)p++;
}
g<<p;
f.close();
g.close();
return 0;
}