1010 Radix （25 point(s)）

最新推荐文章于 2020-12-23 20:06:10 发布

徐伯莱

最新推荐文章于 2020-12-23 20:06:10 发布

阅读量207

点赞数

分类专栏： Pat甲级文章标签： Pat甲级

本文链接：https://blog.csdn.net/m0_37691414/article/details/86596870

版权

Pat甲级专栏收录该内容

152 篇文章 1 订阅

订阅专栏

题解

二分查找

#include<iostream>
#include<cstdio>
#include<string>
#include<cmath>
#include<cctype>
#include<algorithm>
using namespace std;
typedef long long LL;
LL getDec(string s, const int& radix) {
	LL ret = 0;
	reverse(s.begin(), s.end());
	for(int i = 0; i < s.length(); ++i) {
		LL a;
		if(isalpha(s[i])) a = s[i] - 'a' + 10;
		else a = s[i] -'0';
		ret += a * pow(radix, i); 
	}
	return ret;
}
LL getMinRadix(const string& s) {
	LL minRadix = -1;
	for(int i = 0; i < s.length(); ++i) {
		LL a;
		if(isalpha(s[i])) a = s[i] - 'a' + 10;
		else a = s[i] - '0';
		minRadix = max(minRadix, a);
	}
	return minRadix + 1; // 最小的数+1为下界 
}
LL bSearch(LL l, LL r, const LL& num, const string& s) {
	while(l < r) {
		LL m = l + (r - l) / 2;
		LL t = getDec(s, m);
		if(num == t) return m;
		else if(num < t || t < 0) r = m; // 别忘记考虑t溢出变负值的情况。。。 
		else l = m + 1;
	}
	return -1;
}
int main() {
	string n1, n2;
	int tag, radix;
	cin >> n1 >> n2 >> tag >> radix;
	if(tag == 2) swap(n1, n2);
	LL num = getDec(n1, radix);
	LL l = getMinRadix(n2);
	LL r = max(l, num) + 1; // +1   [l, r) bsearch 
	int flag = bSearch(l, r, num, n2);
	if(flag == -1) printf("Impossible");
	else printf("%lld", flag);
	return 0;
}