Pagini recente » Cod sursa (job #2545947) | Cod sursa (job #200737) | Cod sursa (job #617917) | Cod sursa (job #2068145) | Cod sursa (job #1748869)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
const long long M=1000000000;
ifstream f("fact.in");
ofstream g("fact.out");
int p,i=1,nr5=0;
int n5(long long p)
{
int pow = 1, s = 0;
while ( pow * 5 <= p)
{
pow *= 5;
s += p/pow;
}
return s;
}
int vf(int i)
{
while(nr5<p)
{
i++;
if(n5(i)==p) break;
}
return n5(i)==p ? i : -1 ;
}
int main()
{
f>>p;
g<<vf(i);
return 0;
}