Cod sursa(job #809376)
| Utilizator |  Andrei Lecu Andreil |
Data | 8 noiembrie 2012 10:46:26 |
|---|---|---|---|
| Problema | Factorial | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.32 kb |
#include<fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int s0,n,i=5;
int pow(int i)
{
int s=0;
while(i%5==0)
{
i=i/5;
s++;
}
return s;
}
int main()
{
f>>n;
f.close();
while(s0<n)
{ s0=s0+pow(i);
i=i+5;
}
if(s0==n)
g<<i-5;
else g<<-1;
return 0;
}