Cod sursa(job #1951690)
Utilizator | Data | 3 aprilie 2017 19:07:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
using namespace std;
int prim(int n, int d)
{
if(n<2 || (n>2 && n%2==0))return 0;
if(d*d<=n)
{
if(n%d==0)return 0;
return prim(n,d+2);
}
return 1;
}
int nrprim(int n)
{
if(n==1)return 0;
if(n>1 && prim(n,3)==1) return 1+nrprim(n-1);
else return nrprim(n-1);
}
int main()
{ int n;
cin>>n;
cout<<nrprim(n);
return 0;
}