1019 General Palindromic Number （PAT甲级）

#include 
#include 
#include 

int N, b;
std::vector vec, rev;

int main(){
    scanf("%d %d", &N, &b);
    while(N > 0){
        vec.push_back(N % b);
        N /= b;
    }
    rev = vec;
    reverse(vec.begin(), vec.end());
    printf("%s\n", vec == rev ? "Yes" : "No");
    for(int i = 0; i < vec.size(); ++i){
        printf("%d%s", vec[i], i == vec.size() - 1 ? "" : " ");
    }
    return 0;
}

题目如下：

A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers.

Although palindromic numbers are most often considered in the decimal system, the concept of palindromicity can be applied to the natural numbers in any numeral system. Consider a number N>0in base b≥2, where it is written in standard notation with k+1 digits ai​ as ∑i=0k​(ai​bi). Here, as usual, 0≤ai​

Given any positive decimal integer N and a base b, you are supposed to tell if N is a palindromic number in base b.

Input Specification:

Each input file contains one test case. Each case consists of two positive numbers N and b, where 0

Output Specification:

For each test case, first print in one line Yes if N is a palindromic number in base b, or No if not. Then in the next line, print N as the number in base b in the form "ak​ ak−1​ ... a0​". Notice that there must be no extra space at the end of output.

Sample Input 1:

27 2

Sample Output 1:

Yes
1 1 0 1 1

Sample Input 2:

121 5

Sample Output 2:

No
4 4 1