Pagini recente » Cod sursa (job #122890) | Cod sursa (job #1098068) | Cod sursa (job #1034850) | Cod sursa (job #2146174) | Cod sursa (job #395645)
Cod sursa(job #395645)
#include <fstream>
using namespace std;
ifstream fi("fact.in");
ofstream fo("fact.out");
long long a[20]={0, 25}, b[20]={1};
int p1(int n){
int p=0, i;
long nr=5;
for(i=1;i<=16;i++)
if(nr<=n){
p+=n/nr;
nr*=5;
}
else break;
return p;
}
int main(){
int p, i=1, ls, ld;
fi>>p;
if(p==0){
fo<<1;
return 0;
}
while(p>=b[i-1]){
if(i>1)
a[i]=a[i-1]*5;
b[i]=b[i-1]*5+1;
if(b[i]==p){
fo<<a[i];
return 0;
}
i++;
}
i=a[i-2]+1;
ld=a[i-1];
for(i=ls;i<ld;){
if(p1(i)==p){
fo<<i;
return 0;
}
if(p>p1(i))
i+=p-p1(i);
if(p<p1(i))
i-=p1(i)-p;
}
fo<<-1;
return 0;
}