1010 Radix （25 分）mark

看完答案觉得思路不算太复杂，但是我自己确实做不出来，全程按照答案走，mark一下，过些日子，重新再做一遍

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
long long change[256];
char n1[15], n2[15],temp[15];
int tag, radix;
long long inf = (1LL<<63)-1;//mark一下，新学到的写法
void init()//初始化各个字符,分别映射到相应数字（感觉好像可以直接用map函数）
{
	for (char c = '0'; c <= '9'; c++)
	{
		change[c] = c - '0';
	}
	for (char c = 'a'; c <= 'z'; c++)
	{
		change[c] = c - 'a'+10;
	}
}
long long convert10(char a[], long long radix, long long t)//把n1转化为十进制
{
	long long ans = 0;
	int len = strlen(a);
	for (int i = 0; i < len; i++)
	{
		ans = ans * radix + change[a[i]];
		if (ans<0 || ans>t) return -1;
	}
	return ans;
}
long long findlargest(char a[])
{
	long long large=-1;
	int len = strlen(a);
	for (int i = 0; i < len; i++)
	{
		if (change[a[i]] > large) large = change[a[i]];
	}
	return large+1;
}
int cmp(char a[],long long mid,long long t)
{
	int len = strlen(a);
	long long num = convert10(a, mid, t);
	if (num < 0) return 1;//溢出，radix取值过大
	else if (t > num) return -1;
	else if (t == num) return 0;
	else return 1;
}
long long bsearch(char a[], long long left, long long right, long long t)
{	
	while (left <= right)//注意这里要取到等号，不然会漏很多解
	{
		long long mid=(left+right)/2;
		int flag = cmp(a, mid, t);
		if (flag == 0) return mid;
		if (flag == -1) left = mid + 1;
		else right = mid - 1;
	}
	return -1;
}
int main()
{
	init();
	scanf("%s %s %d %d", n1, n2, &tag, &radix);
	if (tag == 2)//确保n1已知进制，要求的是n2
	{
		strcpy(temp, n1);
		strcpy(n1, n2);
		strcpy(n2, temp);
	}
	//求n1在十进制下的值
	long long t = convert10(n1, radix, inf);
	//n2进制的下界为最大那个数加一
	long long low = findlargest(n2);
	//上界为n1十进制加一或者low+1
	long long high = max(t, low) + 1;
    //接下来以二分法寻找n2的进制
	long long radix2 = bsearch(n2, low, high, t);
	if (radix2 == -1) printf("Impossible");
	else printf("%lld", radix2);
	return 0;
}