Pagini recente » Cod sursa (job #1299953) | Cod sursa (job #2873291) | Cod sursa (job #1601443) | Cod sursa (job #1468369) | Cod sursa (job #1526113)
#include<iostream>
#include<fstream>
using namespace std;
int p;
int solutie(int n){
int sum=0;
for(int i=5;n/i>0;i*=5)
sum+=n/i;
if(sum==p)
return 1;
return 0;
}
int cautare(int i,int j){
if(i>j)return -1;
int mij=(i+j)/2;
if(solutie(mij)&& !solutie(mij-1))
return mij;
if(solutie(mij) && solutie(mij-1))
return cautare(i,mij-1);
if(!solutie(mij))
return cautare(mij+1,j);
}
int main(){
ifstream f("fact.in");
f>>p;
//cout<<cautare(0,p*5);
ofstream g("fact.out");
g<<cautare(0,p*5);
//system("pause");
return 0;
}