PAT Class A 1019 Common Palindrome Numbers

Original title link

A number is a palindrome if it reads exactly the same from front to back as it does from back to front.

For example, 1234321 is a palindrome.

All one-digit numbers are palindromes.

We generally consider palindrome in decimal, but the concept of palindrome can also be applied to numbers in other bases.

An integer N has k+1 bits in base b, and the i-th digit is ai, (0≤i≤k), then N=∑ki=0(aibi).

In general, 0≤ai

If ai=ak−i is satisfied for any i, then N is a palindrome in base b.

0 is represented as 0 in any base, and is considered a palindrome.

Now given an integer N, please judge whether it is a palindrome in the base b representation.

Input format
A line containing two integers N and b.

Output format
The output consists of two lines.

If N is a palindrome in base b, the first line outputs Yes, otherwise it outputs No.

The second line, output the representation of N in base b, including k+1 integers, and it is required to output ak,ak−1,…,a0 in order, and the integers are separated by spaces.

Data Range
0≤N≤109,
2≤b≤109
Input Example 1:
27 2
Output Sample 1:
Yes
1 1 0 1 1
Input Sample 2:
121 5
Example output 2:
No
4 4 1

My solution:

#include using namespace std;const int N = 1e9 + 10;int n, b;vector nums;bool check(){for(int i = 0, j = nums.size() - 1; i < j; i ++, j --){if(nums[i] != nums[j]){return false;}}return true;}int main(){cin >> n >> b;if(!n) nums.push_back(0);while(n) nums.push_back(n%b), n/=b;if(check()) puts("Yes");else puts("No");cout << nums.back();for(int i = nums.size() - 2; i >= 0; i -- ) cout << " " << nums[i];return 0;}