PAT 甲级 1019  General Palindromic Number

1019 General Palindromic Number （20 point(s)）

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​​<b for all i and a​k​​ is non-zero. Then N is palindromic if and only if a​i​​=a​k−i​​ for all i. Zero is written 0 in any base and is also palindromic by definition.

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<N≤10​9​​ is the decimal number and 2≤b≤10​9​​ is the base. The numbers are separated by a space.

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

Experiential Summing-up

This question is easy to solve. So I don't say more about it.

(The purpose of using English to portray my solution is that to exercise the ability of my expression of English and accommodate PAT advanced level's style.We can make progress together by reading and comprehending it. Please forgive my basic grammar's and word's error. Of course, I would appreciated it if you can point out my grammar's and word's error in comment section.( •̀∀•́ ) Furthermore, Big Lao please don't laugh at me because I just a English beginner settle for CET6    _(:з」∠)_  )

Accepted Code

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int INF=0x3fffffff;

bool judge(int z[],int len)
{
	for(int i=0;i<len/2;++i)
	{
		if(z[i]!=z[len-1-i])
			return false;
	}
	return true;
}
int main()
{
	int n,b;
	scanf("%d %d",&n,&b);
	int z[40],len=0;
	do
	{
		z[len++]=n%b;
		n/=b;
	}while(n);
	printf("%s\n",judge(z,len)?"Yes":"No");
	for(int i=len-1;i>=0;--i)
	{
		printf("%d",z[i]);
		if(i!=0)
			printf(" ");
		else
			printf("\n");
	}
	return 0;
}