#include <bits/stdc++.h>
using namespace std;
#define maxn 200 + 10
char p1[maxn];
int p2[maxn];
int n;
void solve()
{
int len = strlen(p1);
reverse(p1, p1+len);
memset(p2, 0, sizeof(p2));
int cnt = 0;
for(int i=0; i<len; i++)
{
int t;
if(p1[i]>='a' && p1[i]<='z')
t = p1[i] - 'a' + 10;
else t = p1[i] - '0';
p2[i*2] += t%n;
p2[i*2+1] += t/n;
if(t/n) cnt = i*2 + 1;
}
for(int i=cnt; i>=0; i--)
cout<<p2[i];
cout<<endl;
}
int main()
{
int T;
cin>>T;
while(T--)
{
cin>>n;
scanf("%s", p1);
if(p1[0] == '0') cout<<0<<endl;
else solve();
}
return 0;
}
/*
3
6
nicopoiduang
6
becareful
6
qgjsd
*/
水题
最新推荐文章于 2023-12-10 19:53:33 发布