Pagini recente » Cod sursa (job #880863) | Cod sursa (job #2254038) | Cod sursa (job #1665009) | Cod sursa (job #1025912) | Cod sursa (job #2294325)
#include <fstream>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int factorial(int n)
{
int cnt = 0;
while(n > 5)
{
cnt += n / 5;
n /= 5;
}
return cnt;
}
int main()
{
int P, n, stg, dr, mid;
fin >> P;
if(P == 0)
{
fout << 1;
return 0;
}
stg = 1;
dr = 5000000;
while(stg < dr)
{
mid = stg+ (dr-stg)/2;
if(factorial(mid) > P)
dr = mid - 1;
else if(factorial(mid) < P)
stg = mid + 1;
else if(factorial(mid) == P)
break;
}
mid -= mid % 5;
fout << mid;
return 0;
}