题目描述:
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
这道题的描述理解起来还颇费劲,但是这道题其实理解起来很简单,6==110的情况是6是十进制,而110是二进制的情况,那么我现在给予一个数字,并且给予这个数字的radix(进制),那么请找到使得后一个数字等于前一个数字的进制。如果不相等的,输出”Impossible”
这道题的本质是一个搜索问题,我们要搜索这样的一个符合条件的进制,那么搜索的范围就是进制不能比数字的每一位还小,最大也不能超过另一个数字+1,进行二分搜索能够加快搜索的速度。
这样要注意的是,这里面有很多数据很大,需要要long long表示