Cod sursa(job #236464)
Utilizator | Data | 27 decembrie 2008 17:42:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream.h>
#include <math.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
long s, n, i, j, sw;
int main()
{
s=1;
f>>n;
for (i=3;i<=n;i=i+2)
{
sw=0;
for (j=3;j<=sqrt(i);j=j+2)
if (i%j==0)
{
sw=1;
break;
}
if (sw==0)
s++;
}
g<<s;
return 0;
}