Cod sursa(job #1602684)
Utilizator | Data | 16 februarie 2016 21:22:54 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("factorial.in");
ofstream g("factorial.out");
int main()
{
int p,h=0;
f>>p;
if(p==0)g<<1;
long long n=1;
while (h<p)
{
h=0;
for( int i=1;i<=n;i++)
{long long aux=i;
int k=0;
while(aux%5==0)
{
k++;
aux=aux/5;
}
h=h+k;
}
if(h==p) g<<n;
else n++;
}
}