PAT A 1010 Radix

#include<iostream>
#include<cctype>
#include<algorithm>
#include<cmath>
using namespace std;

typedef long long LL;

LL convert(string s,LL radix)
{
    LL sum=0,temp;
    int i=0;
    while(s[i]!='\0'){
        temp=isdigit(s[i])?s[i]-'0':s[i]-'a'+10;
        sum=sum*radix+temp;
        i++;
    }
    return sum;
}

LL find_radix(string n,LL num)
{
    char it=*max_element(n.begin(),n.end());
    LL low=(isdigit(it)?it-'0':it-'a'+10)+1;
    LL high=max(num,low);
    while(low<=high){
        LL mid=(low+high)/2;
        LL t=convert(n,mid);
        if(t<0||t>num)      high=mid-1; //radix太大
        else if(t==num)     return mid;
        else    low=mid+1;
    }
    return -1;
}

int main(void)
{
    string n1,n2;
    LL tag,radix,result_radix;
    cin>>n1>>n2>>tag>>radix;
    result_radix=(tag==1?find_radix(n2,convert(n1,radix)):
        find_radix(n1,convert(n2,radix)));
    if(result_radix!=-1)
        cout<<result_radix<<endl;
    else
        cout<<"Impossible"<<endl;
    return 0;
}

它的radix为什么可以这么大…我开始还以为就是0~35之间
晴神的代码看着好像更麻烦，上面的是柳神的代码。我自己按0~35写 的只有十来分。