#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
long long todemical(string a, int m) {
long long total = 0;
int number;
//进行数值转化的时候,从高数位到低数位要依次乘以radix of the number然后加上下一位的数。从低数位到高数位进行遍历的时候,要分别用进制的0,1,2,3,.....方乘以对应的位数
while (a.length()) {
if ('a' <= *(a.begin()) && *(a.begin()) <= 'z')
number = (int)*(a.begin()) - 'a' + 10;
else
number = (int)*(a.begin()) - '0';
a.erase(a.begin());
total = total * m + number;
}
return total;
}
long long getradix(string str, long long target) {
char it = *max_element(str.begin() , str.end());
long long min = 2;
long long max = min>target? min:target;
long long mid = (max + min) / 2;
while (min <= max) {
if (todemical(str, mid) == target)
return mid;
else if (todemical(str, mid) > target || todemical(str, mid) < 0)
max = mid - 1;
else
min = mid + 1;
mid = (min + max) / 2;
}
return -1;
}
int main() {
string a[2];
int n, m;
cin >> a[0] >> a[1] >> n >> m;
long long result;
if (n == 1) {
result = getradix(a[1], todemical(a[0], m));
}
else {
result = getradix(a[0], todemical(a[1], m));
}
if (result == -1)
cout << "Impossible";
else
printf("%lld",result);
}
1010 Radix (25 分)
最新推荐文章于 2024-09-20 13:42:43 发布