Pagini recente » Cod sursa (job #256090) | Cod sursa (job #326428) | Cod sursa (job #2109711) | Cod sursa (job #167106) | Cod sursa (job #1023148)
#include<iostream>
#include<fstream>
using namespace std;
int check( int x)
{
int nr = 0;
while(x)
{
nr += x / 5;
x /= 5;
}
return nr;
}
/*long long power( int k)
{
long long a=power( k / 2 );
if(k % 2 == 1)
return 10 * a * a;
return a * a;
}*/
int binary_search( int x)
{
long long i, pas=1<<30;
for(i = 0; pas; pas >>= 1)
if( check( i + pas) < x)
i += pas;
if( check( i + 1) == x)
return i + 1;
return -1;
}
int main()
{
ifstream f( "fact.in");
ofstream g( "fact.out");
long long k, j;
f >> k;
g<< binary_search( k);
}