Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 题解 » 

PAT 1019. General Palindromic Number

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 ai as the sum of (aibi) for i from 0 to k. Here, as usual, 0 <= ai < b for all i and ak is non-zero. Then N is palindromic if and only if ai = ak-i for all i. Zero is written 0 in any base and is also palindromic by definition.

Given any non-negative 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 non-negative 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 "ak ak-1 … a0". Notice that there must be no extra space at the end of output.

Sample Input 1

27 2

Sample Output 1

1 1 0 1 1

Sample Input 2

121 5

Sample Output 2

4 4 1


#include <cstdio>
using namespace std;

int main()
	int n, b, a[10000], id = 0; scanf("%d%d", &n, &b);
	if (n == 0) { printf("Yes\n0\n"); return 0; }

	while (n) a[id++] = n % b, n /= b;
	bool is = 1;
	for (int i = 0, j = id-1; i < j; i++, j--) 
		if (a[i] != a[j]) { is = 0; break; }

	printf("%s\n%d", is ? "Yes" : "No", a[id-1]);
	for (int i = id-2; i >= 0; i--) printf(" %d", a[i]);

	return 0;
上一篇: 下一篇: