Pagini recente » Cod sursa (job #1244828) | Cod sursa (job #2221982) | Cod sursa (job #2828058) | Cod sursa (job #1087839) | Cod sursa (job #1526155)
#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 0;
if(sum>p)
return 1;
return -1;
}
int main(){
ifstream f("fact.in");
f>>p;
ofstream g("fact.out");
long long solution=15*p;
long long lower_bound=0;
long long upper_bound=10*p;
do{
long long mij=(lower_bound+upper_bound)/2;
if(solutie(mij)==0)
solution=min(solution,mij);
if(solutie(mij)==1)
upper_bound=mij-1;
if(solutie(mij)==-1)
lower_bound=mij+1;
}while(lower_bound<upper_bound);
f.close();
g.close();
//system("pause");
return 0;
}