LightOJ 1138 Trailing Zeroes (III) 二分查找

1. 线性变化可以想二分。
2. 末尾的0的个数只和5有关。

#pragma comment(linker,"/STACK:1024000000,1024000000")
#include<cstdio>
#include<iostream>
#include<sstream>
#include<cstdlib>
#include<cmath>
#include<cctype>
#include<string>
#include<cstring>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<vector>
#include<fstream>
#include<list>
using namespace std;

#define ms(s) memset(s,0,sizeof(s))
typedef unsigned long long ULL;
typedef long long LL;

const int INF = 0x3fffffff;

LL getNum(LL n){
    LL ans = 0;
    while(n){
        ans += n/5;
        n /= 5;
    }
    return ans;
}

LL b_search(LL l, LL r, LL v){
    while(l < r){
//        printf("%lld %lld\n",l,r);
        LL m = (l+r)/2;
        LL t = getNum(m);
        if(v <= t)
            r = m;
        else
            l = m+1;
    }
    if(v != getNum(l))
        return -1;
    else
        return l;
}

int main()
{
//    freopen("F:\\input.txt","r",stdin);
//    freopen("F:\\output.txt","w",stdout);
//    ios::sync_with_stdio(false);

    LL q;
    int t;
    LL ans;
    scanf("%d",&t);
    for(int cas = 1; cas <= t; ++cas){
        scanf("%lld",&q);
        ans = b_search(1,1000000000000LL,q);
        if(ans == -1)
            printf("Case %d: impossible\n",cas);
        else
            printf("Case %d: %lld\n",cas,ans);
    }
    return 0;
}