Cod sursa(job #279926)
Utilizator | Data | 13 martie 2009 09:09:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include<fstream.h>
int main ()
{
int ok;
long n,k=0,i,j;
ifstream f("ciur2.in");
ofstream g("ciur2.out");
f>>n;
for(i=2;i<=n;i++)
{
ok=0;
for(j=2;j<=i-1;j++)
if(i%j==0)
ok=1;
if(ok==0) k++;
}
g<<k;
f.close();
g.close();
return 0;
}