Pagini recente » Cod sursa (job #2379709) | Cod sursa (job #437799) | Cod sursa (job #1921850) | Cod sursa (job #63777) | Cod sursa (job #2261688)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
int P;
int fact(int N)
{
int nullak=0;
while(N != 0)
{
nullak += N/5;
N /= 5;
}
if(nullak < P)return 1;
else return 0;
}
int binker(int a, int b, int x)
{
if(a==b)return a;
int p=(a+b)/2;
if(fact(p)) return binker(p+1,b,x);
else return binker(a,p,x);
}
int main()
{
int N=1;
ifstream in("fact.in");
ofstream out("fact.out");
in>>P;
if(P == 0) out<<1;
else
out<<binker(1, 100000000, P);
return 0;
}