0分求调

#include<bits/stdc++.h>
using namespace std;
string num_a="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int num_la[30]：{10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36};
string num_b="0123456789";
int num_lb[15]={0,1,2,3,4,5,6,7,8,9};
string num_r;
int cnt=0,tnt=1;
bool flag=false;
int n,r;
int main(){
	cin>>n>>r;
	while(n){
		for(int k=0;k<cnt;k++){
			tnt=tnt*r;
		}
		if(flag==false){
			for(int i=r-1-10;i>=0;i--){
				if(num_la[i]*tnt<=n){
					n=n-num_la[i];
					num_r=num_a[i]+num_r;
					flag=true;
					break;
				}
			}
		}
		if(flag=false){
			for(int i=10;i>=0;i--){
				if(num_lb[i]*tnt<=n){
					n=n-num_lb[i];
					num_r=num_b[i]+num_r;
					flag=true;
					break;
				}
			}
		}
		n=n/r;
		cnt++;
	}
	cout<<num_r<<endl;
	return 0;
}