Cod sursa(job #1985401)
| Utilizator | Data | 27 mai 2017 20:37:26 | |
|---|---|---|---|
| Problema | Factorial | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int cate_cif(long n)
{
int i=0;
while(n%10==0)
{
i++;
n/=10;
}
return i;
}
long long fact(long long n)
{
if(!n)
return 1;
return n*fact(n-1);
}
long long cautare(long long P)
{
long long i=1;
while(P!=cate_cif(fact(i)))
i++;
return i;
}
int main()
{
long long P;
f>>P;
g<<cautare(P);
return 0;
}
