Cod sursa(job #2225518)
| Utilizator | Data | 27 iulie 2018 14:10:07 | |
|---|---|---|---|
| Problema | Factorial | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
int p, n;
int Factorial(int i){
int s = 0;
double k = 1;
int copie = i;
while(i > 0){
i = copie;
i /= pow(5, k);
s += i;
++k;
}
return s;
}
int main()
{
cin >> p;
for(int i = 1; i <= p*5; ++i){
int copie = i;
if(Factorial(i) == p){
n = i;
break;
}
}
if(p == 0){
n = 1;
}
cout << n << endl;
}
