1138～Trailing Zeroes (III) （二分法的应用）

最新推荐文章于 2024-03-01 21:55:42 发布

Hengzuzong

最新推荐文章于 2024-03-01 21:55:42 发布

阅读量202

点赞数

分类专栏：算法～～

本文链接：https://blog.csdn.net/gao506440410/article/details/81265082

版权

算法～～专栏收录该内容

44 篇文章 0 订阅

订阅专栏

一道关于二分法的题

You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2*...*N. For example, 5! = 120, 120 contains one zero on the trail.

Input

Input starts with an integer T (≤ 10000), denoting the number of test cases.

Each case contains an integer Q (1 ≤ Q ≤ 108) in a line.

Output

For each case, print the case number and N. If no solution is found then print 'impossible'

.Sample Input

Sample Output

Case 1: 5

Case 2: 10

Case 3: impossible

这是一个求 n的阶乘尾数0的个数的一种方法。详解如下。

https://blog.csdn.net/ee8736199/article/details/48105017


#include<stdio.h>
int num(int n) //求n的阶乘末尾连续0的个数 
{              
      
      int ans=0;
      while(n)
      {ans+=n/5;
       n=n/5;    
     }
     return ans;    
}
 int main()
 {
     int mid,i=1;
     int t ,q;
     long long l,r;
     scanf("%d",&t);
     while(t--)
     {scanf("%d",&q);
      l=0;
      r=100000000000000;  //r要大于1e8
      long long m=0;
      while(l<=r)
        {mid=(l+r)/2;
         if(num(mid)==q)
           {r=mid-1;
            m=mid;    
           }
         else 
           {if(num(mid)>q)       //二分法
                r=mid-1;       
            else l=mid+1;      
           }    
        }
       if(m==0) printf("Case %d: impossible\n",i); 
       else printf("Case %d: %lld\n",i,m);
       i++;    
     }
     return 0;
}