模板 进制转换（带负数）

#include<bits/stdc++.h>
using namespace std;
#define maxn 1000005
typedef long long ll;
ll n,r;
char T[20] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};
ll ch(ll n,ll k)
{
    if(n%k < 0)
        return n-k*(n/k+1);   //处理负数
    else
        return n%k;
}
string ans;
int main()
{
    ios::sync_with_stdio(false);
    cin >> n >> r;
    cout << n << "=";
    while(n)
    {
        ans+=T[ ch(n,r) ];
        if(n%r < 0)
            n = n/r + 1;
        else
            n = n / r;
    }
    reverse(ans.begin(),ans.end());
    cout << ans << "(base" << r << ")" << endl;
    return 0;
}