【甲级】1010 Radix (25 分)——（数制转换与二分）

Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is “yes”, if 6 is a decimal number and 110 is a binary number.

Now for any pair of positive integers N1 and N2, your task is to find the radix of one number while that of the other is given.

Input Specification:

Each input file contains one test case. Each case occupies a line which contains 4 positive integers:

N1 N2 tag radix

Here N1 and N2 each has no more than 10 digits. A digit is less than its radix and is chosen from the set {0-9, a-z} where 0-9 represent the decimal numbers 0-9, and a-z represent the decimal numbers 10-35. The last number “radix” is the radix of N1 if “tag” is 1, or of N2 if “tag” is 2.

Output Specification:

For each test case, print in one line the radix of the other number so that the equation N1 = N2 is true. If the equation is impossible, print “Impossible”. If the solution is not unique, output the smallest possible radix.

Sample Input 1:

6 110 1 10

Sample Output 1:

2

Sample Input 2:

1 ab 1 2

Sample Output 2:

Impossible

题目大意：

给定两个数n1与n2，当tag为1时表示n1为radix进制，tag为2是表示n2为radix进制；输出另一没给定进制的数在什么进制下两数相等。

分析及思路：

convart函数：将任意进制数转化为10进制，转化过程中可能产生溢出。

find_radix函数：找到令两个数值相等的进制数。在查找的过程中，需要使用二分查找算法，更快捷方便。

AC代码：

#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>

using namespace std;
long long convart(string n, long long radix){//将任意数值转换为10进制数 
	long long sum = 0;
	int cnt = 0, temp;
	for(int i = n.size() - 1; i >= 0; i--){
		temp = isdigit(n[i]) ? n[i] - '0' : n[i] - 'a' + 10;
		sum += temp * pow(radix, cnt++);
	}
	return sum;
}

long long find_radix(string n, long long num){//寻找相等的进制 
	char s = *max_element(n.begin(), n.end());
	long long low = (isdigit(s) ? s - '0' : s - 'a' + 10) + 1;//最小进制为该数中最大的数字 
	long long high = max(num, low);//最大进制为另一个数 
	while(low <= high){
		long long mid = (low + high) / 2;
		long long t = convart(n, mid);
		//如果使用当前进制转化得到数值比另一个大或者小于0，说明这个进制太大 
		if(t < 0 || t > num) high = mid - 1;
		else if(t == num) return mid;
		else low = mid + 1;
	}
	return -1;
}

int main(){
	string n1, n2;
	long long tag = 0, radix = 0, R_radix;
	cin >> n1 >> n2 >> tag >> radix;
	
	//当第一个数的进制为radix时，把该数转换为10进制，同第二个数传递给find_radix函数 
	//把给了进制的数转换为10进制，同另一个数传递 
	if(tag == 1) 
		R_radix = find_radix(n2, convart(n1, radix));
	else 
		R_radix = find_radix(n1, convart(n2, radix));
	
	if(R_radix == -1) cout << "Impossible" << endl;
	else cout << R_radix << endl;
	return 0;
}