Pagini recente » Cod sursa (job #752494) | Cod sursa (job #147991) | Cod sursa (job #2369124) | Cod sursa (job #1693271) | Cod sursa (job #1526150)
#include<iostream>
#include<fstream>
using namespace std;
int p;
int solutie(long long n){
long long sum=0;
for(int i=5;n/i>0;i*=5)
sum+=n/i;
if(sum==p)
return 2;
if(sum>p)
return 1;
return 0;
}
int main(){
ifstream f("fact.in");
f>>p;
ofstream g("fact.out");
long long lower_bound=0;
long long upper_bound=5*p;
while(lower_bound<=upper_bound){
long long mij=(lower_bound+upper_bound)/2;
if(solutie(mij)==2){
g<<mij;
return 0;
}
if(solutie(mij)==1)
upper_bound=mij-1;
if(solutie(mij)==0)
lower_bound=mij+1;
}
f.close();
g.close();
//system("pause");
return 0;
}