[ PAT-A ] 1019 General Palindromic Number (C++)

题目描述

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 the sum of (a~i~b^i^) for i from 0 to k. 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 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 “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

---

解题思路

题目大意
将一个十进制数转换为对应的进制数，判断该进制数是否是回文数．注意进制数的所有位数都以十进制数存入数组，如10进制的10转为16进制为Ａ，但存入数组时仍以10存入
思路

• 进制转换，将十进制数转为对应的进制数，并将其每一位存入数组中
• 遍历数组，判断其是否为回文数

---

代码设计

[任务] 进制转换，并将其结果存入数组
[接口]
inline void getHex(int n,int b,int* re,int& tot)
输入: n 十进制数，b需要转为的进制，re 最终需存放的数组，tot 数组长度

//代码实现
//zhicheng
inline void getHex(int n,int b,int* re,int& tot)
{
    if(n==0) {re[tot++]=0;return;}
    while(n) {re[tot++]=n%b;n/=b;}
}

[任务] 判断一个数组是否是回文数
[接口]
inline bool is_Test(int re[],int tot)
输入: re 数组，tot 数组长度
输出：如果数组是回文数，则返回true

//代码实现
//zhicheng
inline bool is_Test(int re[],int tot)
{
    for(int i=0,j=tot-1;i<=j;i++,j--)
        if(re[i]!=re[j]) return false; 
    return true;
}

---

有关PAT (Basic Level) 的更多内容可以关注 ——> PAT-B题解

有关PAT (Advanced Level) 的更多内容可以关注 ——> PAT-A题解

铺子日常更新，如有错误请指正
传送门：代码链接 PTA题目链接 牛客网题目链接 PAT-A题解