神奇的进制转换

https://ac.nowcoder.com/acm/contest/910/C 

题意：进制转换

总结：从最高位开始模拟除法，直到把原来的数除尽；每次除法剩下的余数就是答案的最低位到最高位的数；就像十进制转二进制一样，一直除，答案就是全部余数倒过来！

#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

int n,m;
char s[400];
int ans[maxn];
int Getnum(char c)
{
    if(c>='0'&&c<='9') return c-'0';
    else if(c>='A'&&c<='Z') return c-'A'+10;
    else return c-'a'+36;
}
char Getchar(int x)
{
    if(x>=0&&x<=9) return x+'0';
    else if(x>=10&&x<=35) return x+'A'-10;
    else return x-36+'a';
}
void solve(char s[],int m,int n)
{
    int len=strlen(s);
    int asize=0;
    for(int i=0;i<len;)
    {
        int yu=0;
        for(int j=i;j<len;j++)
        {
            int tyu=(Getnum(s[j])+yu*m)%n;
            s[j]=Getchar( (Getnum(s[j])+yu*m)/n );
            yu=tyu;
        }
        ans[asize++]=yu;
        while(Getnum(s[i])==0&&i<len) i++;
    }
    for(int i=asize-1;i>=0;i--)
    {
        cout<<Getchar(ans[i]);
    }
    cout<<endl;
}
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int t;
    cin>>t;
    while(t--)
    {
        cin>>m>>n>>s;
        solve(s,m,n);
    }

    return 0;
}