1010 Radix (25 分) 二分 终于遇到个算法题

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define ull unsigned long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)

#define base 2333
#define ub (1LL<<63)-1
const int mod=1e9+7;
const int maxn=1e4+10;
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
string s[2];
int tag;
ll ans1=0,ans2=0,ind;
int gao(char c){
    if(c<='9'&&c>='0') return c-'0';
    return 10+(c-'a');
}
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll chenfa(ll x,ll y){
    ll ret=0;
    for(;y;y>>=1,x=x+x){
        if(x<0) return -1;
        if(y&1) ret=ret+x;
        if(ret<0) return -1;
    }
    return ret;
}
ll solve(string s,ll t){
    int sz=s.size();
    ll ret=0,pre;
    for(int i=0;i<sz;i++){
        int val=gao(s[i]);
        if(val>=t) return -1;
        pre=ret;
        ret=ret*t+(ll)val;
        if(ret<pre) return __LONG_LONG_MAX__;
    }
    return ret;
}
int main(){
    cin>>s[0]>>s[1]>>tag>>ind;
    ans1=solve(s[--tag],ind);
    ll l=2,r=__LONG_LONG_MAX__,ans=-1;
    tag^=1;///cout<<"YES"<<endl;
    while(l<=r){
        ll mid=l+((r-l)>>1);
        ll ret=solve(s[tag],mid);
        if(ret>ans1){
            r=mid-1;
        }else if(ret<ans1){
            l=mid+1;
        }else {
            ans=mid;
            break;
        }
    }
    if(ans==-1) cout<<"Impossible\n";
    else cout<<ans<<endl;
    return 0;
}