pta1019 General Palindromic Number（20 分）（进制&&数组）

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>0 in base b≥2, where it is written in standard notation with k+1 digits a​i​​ as ∑​i=0​k​​(a​i​​b​i​​). Here, as usual, 0≤a​i​​

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 "a​k​​ a​k−1​​ ... a​0​​". 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

注意0的情况，特殊输出。不然会有一个测试点过不了。虽然当进制很大时每一位不止一位小数，但是还是不足进制数的值一起输出之间无空格。所以不用想复杂了直接用数组就好了，不用字符串。

#include
#include
#include
#include
using namespace std;
int a[40];
int main()
{
	int n,b;
	while(~scanf("%d%d",&n,&b))
	{
		if(n==0)
		{
			printf("Yes\n0\n");
			continue;
		}
		int i=0,flag=1;
		while(n)
		{
			a[i++]=n%b;
			n/=b;
		}
		for(int j=0;j