Pagini recente » Cod sursa (job #2609413) | Cod sursa (job #526187) | Cod sursa (job #329251) | Cod sursa (job #1872947) | Cod sursa (job #1013781)
#include<fstream>
using namespace std;
int n;
ifstream f("fact.in");
ofstream g("fact.out");
long long check(int nr)
{
long long fives = nr / 5;
long long c = 5;
while(c * 5 <= nr)
{
fives++;
c = c * 5;
}
return fives;
}
long long search(long long start, long long end)
{
if(end < start) return -1;
long long nr = start + ((end - start) / 2);
long long fives = check(nr);
if(fives == n) return nr;
return (fives > n) ? search(start, nr-1) : search(nr+1, end);
}
int main()
{
f>>n;
if(n == 0)
{
g<<1;
}
else if(n == 1)
{
g<<5;
}
else
{
long long nr = search(1, 9223372036854775806);
while(check(nr) == n)
{
nr--;
}
if(nr >= 0) nr++;
g<<nr;
}
return 0;
}