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