基数为负数的进制转换

#include<iostream>
#include<cstdio>
#define LL long long
#define maxn 100
#define Max(a,b) a>b?a:b
using namespace std;
char str[20]={'0','1','2','3','4','5','6','7','8','9','10'};
char ss[20]="0123456789ABCDEFGH";
int  cnt=0;
int m;
void solve(int n)
{
    if(n==0)return ;
    int k;
    k=n%m;
    n=n/m;
    if(k<0)
    {
        k-=m;
        n++;
    }
    cout<<"shang="<<n<<endl;
    cout<<"yu="<<k<<endl;
    solve(n);
    printf("%c",ss[k]);
}
int main()
{
    int n;
    while(cin>>n>>m)
    {
        solve(n);
    }
}

即余数不能为负，如果余数为负 商+1 余数-=m