题目链接:https://pintia.cn/problem-sets/994805342720868352/problems/994805507225665536
由于不知道radix如何取值,所以上网搜了一下,
参考博客:https://blog.csdn.net/CV_Jason/article/details/80993283
注意点:二分查找的边界情况(15'->25')
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
ll str_to_num(string str, int radix) {
ll sum = 0;
reverse(str.begin(), str.end());
//n1转成10进制
for (int i = 0; i < str.size(); i++) {
if (str[i] >= '0'&&str[i] <= '9')
sum += pow(radix, i)*(str[i] - '0');
else
sum += pow(radix, i)*(str[i] - 'a' + 10);
}
return sum;
}
long long find_radix(string str, ll num) {
ll res_radix = -1;
char it = *max_element(str.begin(), str.end());//基数radix的下限(即未转换数的最小值)
// ll high = max(num,low);//基数radix的上限
ll low = (isdigit(it) ? it - '0' : it - 'a' + 10) + 1;
ll high = max(num, low);//基数radix的上限
while (low <= high) {
//low<high只能得15分,这说明二分查找的重要性
ll mid = low + (high - low) / 2;
ll temp = str_to_num(str, mid);
if (temp<0 || temp>num) {//基数radix大了,
high = mid - 1;
}
else if (temp < num) {
low = mid + 1;
}
else {
res_radix = mid;
break;
}
}
return res_radix;
}
int main()
{
string n1, n2;
int tag, radix;
cin >> n1 >> n2 >> tag >> radix;
ll stard = 0,res;
if (tag == 1) {
//radix是N1的
stard=str_to_num(n1,radix);
//cout << stard << endl;
res = find_radix(n2, stard);//一开始这里写成radix了,肯定报错啊
//cout << res << endl;
}
else {
//radix是N2的
stard = str_to_num(n2, radix);
//cout << stard << endl;
res = find_radix(n1, stard);
//cout << res << endl;
}
if (res != -1)
cout << res << endl;
else
cout << "Impossible" << endl;
return 0;
}