#include<iostream>
#include<cmath>
using namespace std;
int n, m;
long long num;
string str, str2;
void change_n_to_10(long long& num, string& str)
{
int len = str.length();
for (int i = 0; i < len; i++)
switch (str[i])
{
case 'A':num += 10 * pow(n, len - 1 - i); break;
case 'B':num += 11 * pow(n, len - 1 - i); break;
case 'C':num += 12 * pow(n, len - 1 - i); break;
case 'D':num += 13 * pow(n, len - 1 - i); break;
case 'E':num += 14 * pow(n, len - 1 - i); break;
case 'F':num += 15 * pow(n, len - 1 - i); break;
default:num += (int(str[i]) - 48) * pow(n, len - 1 - i);
}
}
void change_10_to_m(string& str2, long long& num)
{
int len, j;
for (len = 0; pow(m, len) < num; len++) {}
for (len--; len >= 0; len--)
{
for (j = 0; j * pow(m, len) <= num; j++) {}
j--;
num -= j * pow(m, len);
switch (j)
{
case 10:str2 += 'A'; break;
case 11:str2 += 'B'; break;
case 12:str2 += 'C'; break;
case 13:str2 += 'D'; break;
case 14:str2 += 'E'; break;
case 15:str2 += 'F'; break;
default:str2 += char(j + 48);
}
}
}
int main()
{
cin >> n >> str >> m;
change_n_to_10(num, str);
change_10_to_m(str2, num);
cout << str2;
return 0;
}
洛谷P1143 进制转换进阶解法
最新推荐文章于 2024-02-07 16:05:17 发布