[PAT 1022] D进制的A+B

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#define maxn 50
using namespace std;
int a,b,d;
int z[maxn];

void sum2d() {
    int num = 0, sum = a+b;
    do {
        z[num++] = sum % d;
        sum /= d;
    }while(sum != 0);
    for (int i = num-1; i > -1; --i) {
        cout << z[i];
    }
    cout << endl;
}

int main() {
//    FILE* in = fopen("/home/zzz/input.txt", "r");
//    while (fscanf(in, "%d %d %d", &a, &b, &d) != EOF) {
//        sum2d();
//    }

    while(scanf("%d %d %d", &a, &b, &d) != EOF) {
        sum2d();
    }
    return 0;
}

![2019-10-11 15-19-14 的屏幕截图](https://user-images.githubusercontent.com/30946222/66632272-a3179200-ec3a-11e9-87bb-288108240321.png)
原文地址:https://www.cnblogs.com/huangming-zzz/p/11654431.html