分治算法 php,分治算法（1）N！个数为0的情况

#include

#include

#include

#include

#include

using namespace std;

long long solve(long long n)

{

long long sum=0;

while(n>0)

{

n/=5LL;

sum+=n;

}

return sum;

}

int main()

{

int n;

while(~scanf("%d",&n))

{

long long left=1;

long long right=500000000;

long long ans=500000001;

while(left<=right)

{

int mid=(right-left)/2+left;

int t=solve(mid);

if(t==n&&mid

{

ans=mid;

}

if(t>n)

{

right=mid-1;

}

else if(t

{

left=mid+1;

}

else

{

right=mid-1;

}

}

if(ans==500000001)

{

printf("No solution!\n");

}

else

{

printf("%d\n",ans);

}

}

}