Pagini recente » Cod sursa (job #1479151) | Cod sursa (job #211770) | Cod sursa (job #1783740) | Cod sursa (job #429797) | Cod sursa (job #732009)
Cod sursa(job #732009)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int fact(int n)
{
if (n==1 || n==0) return 1;
else return n*fact(n-1);
}
int putere(int n, int p)
{
if (n==0) return 1;
else return putere(n-1,p)*p;
}
int cautare(int st,int dr,int p)
{
int mij=(st+dr)/2;
if (dr-st<=1) return st;
if (fact(mij)%putere(10,p)==0)
return cautare(st, mij, p);
else return cautare(mij+1, dr, p);
}
int main()
{
int P;
do{
f>>P;} while (P<0);
g<<cautare(4*P,5*P,P);
f.close();
g.close();
}