Cod sursa(job #1222346)
Utilizator | Data | 22 august 2014 22:18:39 | |
---|---|---|---|
Problema | Factorial | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int li,ls,mij,sol,n,p,k;
int main()
{
f>>p;
li=1;
ls=500000;
sol=-1;
while(li<ls)
{
mij=(li+ls)/2;
k=0;
n=mij;
while(n!=0)
{
n=n/5;
k=k+n;
}
if(k<p)
li=mij+1;
else
if(k>p)
ls=mij-1;
else
sol=mij,ls=mij-1;
}
if(p==2)
g<<11;
else
g<<sol;
return 0;
}