Cod sursa(job #217104)
Utilizator | Data | 26 octombrie 2008 23:56:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include "fstream.h"
#include "math.h"
int prim(long n)
{for(long i=2;i<=sqrt(n);i++)
if(n%i==0)return 0;
return 1;
}
int main()
{long n,s=0,i;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
if(prim(i))s++;
g<<s;
return 0;
}