Cod sursa(job #2067266)
Utilizator | Data | 16 noiembrie 2017 08:50:26 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
int fr[10];
int main()
{
long long n,p,cop;
ifstream in("fact.in");
ofstream out("fact.out");
in>>p;
n=1;
while(fr[2]<p||fr[5]<p)
{
cop=n;
while(cop>1)
{
while(cop%2==0)
{
cop/=2;
fr[2]++;
}
while(cop%5==0)
{
cop/=5;
fr[5]++;
}
break;
}
n++;
}
if(fr[2]==p||fr[5]==p)
out<<n-1;
else
out<<0;
return 0;
}