/*
*时间:2018年4月24日21:14:40-2018年4月24日22:21:13
*题目:1019.General Palindromic Number
*分数:20
*编译器:g++
*题目描述:
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 <= 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 "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:
Yes
1 1 0 1 1
Sample Input 2:
121 5
Sample Output 2:
No
4 4 1
*/
【PAT甲】A1019
最新推荐文章于 2020-01-16 22:19:48 发布