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=0k(aib**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≤109 is the decimal number and 2≤b≤109 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 … 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
解题思路
本题类似于1015, 将给定的数转化为 k 进制, 问 k进制下的数字时候是回文的,并输出对应k进制的数字序列。
解题代码
#include <cstdio>
using namespace std;
int a[100010];
int n, d, len;
bool is_palinum(int a[]){
for (int i = 0; i <= len / 2; i++)
if (a[i] != a[len - i - 1]) return false;
return true;
}
int main(){
scanf("%d %d", &n, &d);
while(n > 0){
a[len ++] = n % d;
n /= d;
}
printf("%s\n", is_palinum(a) ? "Yes" : "No");
for (int i = len - 1; i > 0; i-- ) printf("%d ", a[i]);
printf("%d", a[0]);
return 0;
}