[PAT解题报告] General Palindromic Number

#include <cstdio>
#include <string>
#include <cstring>
#include <vector>

using namespace std;

bool is(vector<int> &a) {
    for (int i = 0, j = a.size() - 1; i < j; ++i, --j) {
        if (a[i] != a[j]) {
            return false;
        }
    }
    return true;
}

int main() {
int n,b;
vector<int> a;
    scanf("%d%d",&n,&b);
    do {
        a.push_back(n % b);
        n /= b;
    } while (n);
    puts(is(a)?"Yes":"No");
    for (int i = a.size() - 1; i >= 0; --i) {
        if (i < a.size() - 1) {
            putchar(' ');
        }
        printf("%d",a[i]);
    }
    puts("");
    return 0;
}