Cod sursa(job #411223)
| Utilizator | Data | 4 martie 2010 19:28:51 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#include<math.h>
using namespace std;
int prim(long long nr)
{
for(int i=3;i<sqrt(nr);i=i+2) if(nr%i==0) return 0;
return 1;
}
int main()
{
long long n,s=0;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
fi>>n;
for(int i=3;i<=n;i++) if(i%2!=0) if(prim(i)) s++;
fo<<s<<'\n';
fi.close();
fo.close();
return 0;
}
