PAT甲级1010(进制)

1010 Radix (25 point(s))

  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 N_​1 and N_​2, 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在什么 进制下等N1

解题思路

  首先把N1转化为10进制，再用二分法求N2与N1相等的进制，上界是N1的十进制数，下界是N2中最大数字+1，详见代码

代码

#include <iostream>
#include <string>
#include <algorithm>
using namespa