【无标题】

任意进制转换

秦九昭和短除法

#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

string str;
int a[11000];
int cnt;

int qin(string n, int w)
{
	int res = 0;
	for (int i = 0; i < n.size(); i ++ )
	{
		if(n[i] <= '9' && n[i] >= '0') res = res * w + (n[i] - '0');
		else if(n[i] >= 'A' && n[i] <= 'Z') res = res * w + (n[i] - 'A' + 10);
		else if(n[i] >= 'a' && n[i] <= 'z') res = res * w + (n[i] - 'a' + 36);
	}
	return res;
}


int Convert(int n,int b)
{
	while(n)
	{
		a[cnt++] = n % b;
		n = n / b;
	}
}

int main()
{
	cin >> str;
	
	int num = qin(str, 16);
	cout << num << endl;
	Convert(num, 3);
	for (int i = cnt - 1; i >= 0; i -- )
	cout << a[i];
 }