【PAT】A1010 Radix【进制转换】【二分查找】

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，radix。如果tag = 1，代表N1为radix进制，寻找使N1=N2成立的进制数。如果tag = 2，代表N2为radix进制，寻找使N1=N2成立的进制数。

思路

我们默认tag = 1，对于tag = 2的情况将N1，N2交换即可。
对于可能的进制数，其区间为[N2各位中最大的数+1，N2+1]。我们使用二分查找来寻找答案。由于数据过大，查找过程中数据可能溢出，溢出时将N2转换为进制数结果是负数（我们知道无论是多少进制都是不可能转化成负数的，所以可知结果是负数代表结果是一个超过long long的大正数）。

实现代码

#include <iostream>
#include <cmath>
#include <string>
#include <cstdio>
#include <a