Cod sursa(job #305800)
Utilizator | Data | 18 aprilie 2009 17:01:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.23 kb |
#include<fstream.h>
long int i,n,d,j,k=0;
int main ()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for (i=2;i<=n;i++)
{ d=1;
for (j=2;j<=i/2;j++)
{ if(i%j==0) d=0; }
if (d==1) k++; }
out<<k;
return 0;
}