Cod sursa(job #2079905)
| Utilizator | Data | 1 decembrie 2017 23:10:36 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
//Enunt: http://www.infoarena.ro/problema/ciur
#include <iostream>
#include <fstream>
using namespace std;
bool eprim(int n,int d)
{
if(d>n)
return 1;
if(!(n%d))
return 0;
return eprim(n,d*d);
}
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int N,count=0;
f>>N;
for(int i=2;i<=N;++i)
if(eprim(i,2))
++count;
g<<count;
f.close();
g.close();
return 0;
}
