PAT甲级1019 General Palindromic Number (20 分)

1019 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​​<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

题目大意：

         给定一个数n与基b，问n在基b的情况下是否为回文串。输出Yes(No)并在下一行输出相应进制的结果。

 

思路：

         利用reverse函数，第一段是将n转化为b进制的（此时存储的是相反的结果，如sample2，此时存储的144，相当于获得了一个倒置的结果）。然后将其赋值给另一个vector变量，reverse走一趟，reverse出来是输出结果。判断两个变量是否相等即可。

参考代码：

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n, b;
int main(){
	scanf("%d%d", &n, &b);
	vector<int> num1, num2;
	do{
		num1.push_back(n % b);
		n /= b;
	}while(n);
	num2 = num1;
	reverse(num1.begin(), num1.end());
	if(num1 == num2)	printf("Yes\n");
	else	printf("No\n");
	printf("%d", num1[0]);
	for(int i = 1; i < num1.size(); ++i)
		printf(" %d", num1[i]);
	return 0;
}