#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1000;
int a[N];
char ch[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'};
void solve()
{
int n, m;cin >> n >> m;
string s; cin >> s;
int len = s.length();
s = "#" + s;
for (int i = 1; i <= len;i++)
{
if (s[i] >= '0' && s[i] <= '9')
a[i] = s[i] - '0';
else
a[i] = s[i] - 'A' + 10;
}
ll x = 0;
for (int i = 1; i <= len; i++)
{
x = x * n + a[i];
}
string ans;
while(x)
{
ans += ch[x % m];
x /= m;
}
reverse(ans.begin(),ans.end());
cout << ans << '\n';
}
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int _;cin >> _;
while(_--) solve();
return 0;
}
*蓝桥OJ1230进制转换
最新推荐文章于 2024-07-14 13:39:50 发布