PAT(A)1010 Radix (25point(s))

思路：
这是我看过的测试点最多的题，简直多到爆。
看到题面，意识上认为只有36进制就可以了，然而不是，注意爆long long时会变成负数，然后还有，暴力不行，一定要二分找，下界是n2的最低阶，上界是n1的数值和n2的最低阶比较的较大值。

这张图真是贼不容易。
代码：

#include <bits/stdc++.h>
#include <cstdio>

using namespace std;

typedef long long ll;

ll Radix_Change(string x, ll radix)
{
    ll res = 0;
    int num = 0;
    for (int i = 0; i < x.size(); ++i)
    {
        ll r;
        if (x[i] >= '0' && x[i] <= '9')
            r = x[i] - '0';
        else
            r = x[i] - 'a' + 10;
        res = res * radix + (r);
    }
    return res;
}

ll nleft(string n)
{
    ll m = 0;
    for (int i = 0; i < n.size(); ++i)
    {
        ll r;
        if (n[i] >= '0' && n[i] <= '9')
            r = n[i] - '0';
        else
            r = n[i] - 'a' + 10;
        m = max(m, r);
    }
    return m;
}

int main()
{
    string n1, n2, x1, x2;
    ll tag, radix;

    cin >> x1 >> x2 >> tag >> radix;
    if (tag == 2)
    {
        n1 = x2;
        n2 = x1;
    }
    else
    {
        n1 = x1;
        n2 = x2;
    }

    ll a = Radix_Change(n1, radix);
    int f = -1;
    ll xll = nleft(n2) + 1;
    ll xrr = (a > xll ? a : xll) + 1;
    while (xll <= xrr)
    {
        ll m = (xll + xrr) / 2;
        ll r = Radix_Change(n2, m);
        if (r > a || r < 0)
            xrr = m - 1;
        else if (r < a)
            xll = m + 1;
        else if (r == a)
        {
            f = m;
            break;
        }
    }
    if (f == -1)
        cout << "Impossible";
    else
        cout << f;
    // cout << Radix_Change(n2, 2);
    return 0;
}