数位和

#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 10005;
char biao[] = "0123456789ABCDEF";
int main(){
    int a, b;
    char s[maxn];
    int len;
    while (cin >> a >> b){
        int ans = 0;
        len = 0;
        int t;
        while (a){
            int t;
            t = a % b;
            ans += t;
            a /= b;
        }
        while (ans){
            int t;
            t = ans % b;
            ans /= b;
            s[len++] = biao[t];
        }
        for (int i = len - 1; i >= 0; i--){
            cout << s[i];
        }
        cout << endl;
    }

    //system("pause");
    return 0;
}