华师大OJ【1147】进制转换的递归写法

#include<iostream>
using namespace std;
long int n,r;
char a[36]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
int work(long int n)
{
if(n<r)
{
cout<<a
;
return n;
}
else
{
work((n-n%r)/r);
cout<<a[n%r];
}
}
int main()
{
long int t,i,j;
bool check=0;
cin>>t;
for(i=0;i<t;i++)
{
check=0;
cin>>n>>r;
j=0;
if(n<0)
{
check=1;
n=-n;
cout<<'-';
}
work(n);
cout<<endl;
}
}