1010 Radix (25分)

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<string>
using namespace std;
typedef long long LL;
LL inf = (1LL<<63)-1;
LL toInt(char c)
{
	if(c>='0'&&c<='9') return c-'0';
	else return 10+c-'a';
}
//从r进制转为10进制 
long long toDec(string s,LL radix,LL t)
{
	long long ans=0;
	for(int i=0; i<s.size(); i++){
		ans = ans*radix+toInt(s[i]);
		if(ans<0||ans>t) return -1;//转化过程中如果溢出或者已经超过n1就可以及时终止程序 
	}
	return ans;
}

int findLargestNum(string n){
	int ans = -1;
	for(int i=0; i<n.size(); i++){
		int a;
		a = toInt(n[i]);
		if(a>ans) ans = a;
	}
	return ans;
} 

int cmp(LL N1, LL N2)
{
	if(N2==-1) return 1;
	if(N1>N2) return -1;
	else if(N1<N2) return 1; 
	else return 0;
}

LL binarySearch(LL low, LL high, LL N1,string n2)
{
	while(low<=high){
		LL mid = (low+high)/2;
		LL N2;
		N2 = toDec(n2,mid,N1);
		int flag = cmp(N1,N2);
		if(flag==0) return mid;
		else if(flag<0) low = mid+1;
		else high = mid-1;
	}	
	return -1;
} 
int main()
{
	string n1,n2;//n1为进制已知的 
	int tag;
	int radix;
	cin>>n1>>n2>>tag>>radix;
	if(tag==2){
		string tmp;
		tmp = n1;
		n1 = n2;
		n2 = tmp;
	}
	long long N1 = toDec(n1,radix,inf);
	//找到n2进制的上界和下界
	LL low = findLargestNum(n2)+1;
	LL high = max(low,N1)+1;
	//转换n2为long long 类型
	//比较n1与n2大小的函数
	//二分查找 
	LL flag = binarySearch(low,high,N1,n2);
	if(flag<0) printf("Impossible\n");
	else printf("%lld\n",flag);
	return 0;
}