Cod sursa(job #550056)
Utilizator | Data | 9 martie 2011 10:56:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
// ciur
#include <fstream.h>
# include <math.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
long long i,j,nr,pr;
int prim(long long k)
{
for(j=2;j<sqrt(k);j++)
if(k%i==0)
return 0;
return 1;
}
int main()
{
f>>nr;
for(i=2;i<=nr;i++)
if(prim(i))
pr++;
g<<pr+1<<'\n';
f.close();
g.close();
return 0;
}