Cod sursa(job #1168093)
Utilizator | Data | 6 aprilie 2014 22:03:41 | |
---|---|---|---|
Problema | Factorial | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in") ;
ofstream g("fact.out") ;
int numar(int x)
{
int k,s ;
s=0 ;
k=5 ;
while(x/k>0)
{
s+=x/k ;
k*=5 ;
}
return s ;
}
int main()
{
int p,k,s,div ;
f>>p ;
div=1<<30 ;
k=0 ;
while(div>0)
{
if(numar(k+div)<p)
k+=div ;
div/=2 ;
}
if(numar(k+1)==p)
g<<k+1 ;
else
g<<"-1" ;
return 0;
}