Pagini recente » Cod sursa (job #470557) | Cod sursa (job #877476) | Cod sursa (job #1078647) | Cod sursa (job #3005521) | Cod sursa (job #1013637)
#include<fstream>
#include<limits>
using namespace std;
int n;
ifstream f("factorial.in");
ofstream g("factorial.out");
int check(int nr)
{
int fives = nr / 5;
int c = 5;
while(c * 5 <= nr)
{
fives++;
c = c * 5;
}
return fives;
}
int search(int start,int end)
{
int nr = start + ((end - start) / 2);
int fives = check(nr);
if(fives == n) return nr;
if(start == end) return -1;
return (fives > n) ? search(start, nr-1) : search(nr+1, end);
}
int main()
{
f>>n;
int nr = search(1, INT_MAX);
while(check(nr) == n)
{
nr--;
}
nr++;
g<<nr;
return 0;
}