sicily.1813 M进制数问题

解题思路：先将数转换成十进制进行处理，再将结果转换成M进制数

#include <iostream>
#include <string>
#include <vector>
using namespace std;

int change(string s,int m)
{
	int result = 0;
	for(int i = 0;i < s.length();i++)
	{
		if(s[i] >= '0' && s[i] <= '9')
			result = result * m + s[i] - '0';
		if(s[i] >= 'A' && s[i] <= 'Z')
			result = result * m + s[i] - 'A' + 10;
	}
	return result;
}

string changeToM(int a,int m)
{
	string s = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
	string result = "";
	vector<char> data;
	if(a == 0)
		return "0";
	int temp = a;
	while(temp != 0)
	{
		data.push_back(s[temp % m]);
		temp /= m;
	}

	for(int i = data.size() - 1;i >= 0;i--)
		result += data[i];

	return result;
}

int main()
{
	int caseNum;
	cin >> caseNum;
	while(caseNum--)
	{
		int m;
		string a,b;
		cin >> m >> a >> b;

		//先转换成十进制数
		int t1 = change(a,m);
		int t2 = change(b,m);

		int P = t1 / t2;
		int Q = t1 % t2;
		//再将P,Q转换成m进制数
		cout << changeToM(P,m) << endl << changeToM(Q,m) << endl;
	}
	return 0;
}