PAT A1019

• 题目：
  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
题目大意：给定一个10进制整数，转化为一个b进制数，判断转化后的b进制数是否为回文数

• 解题思路
  1.如何将10进制数转化为base进制数，利用除商取余法

int z[40], k = 0;
    do{                               //10进制转化为base 进制
        z[k++] = num % base;
        num = num / base;
    }while(num != 0);

2.如何判断转化后的数是否为回文数
双指针法，分别从前和从后判断数字是否相等

bool judge(int A[], int n)
{
    for(int i = 0; i <n/2; i++)
        if(A[i] != A[n-i-1])
            return false;
    return true;
}

代码实现：

#include <iostream>
using namespace std;
bool judge(int A[], int n)
{
    for(int i = 0; i <n/2; i++)
        if(A[i] != A[n-i-1])
            return false;
    return true;
}
int main()
{
    int num, base;
    cin >> num >>base;
    int z[40], k = 0;
    do{                               //10进制转化为base 进制
        z[k++] = num % base;
        num = num / base;
    }while(num != 0);
    bool tag = judge(z, k);
    if(tag) {
        cout << "Yes"<<'\n';
        for(int i = k-1; i >0; i--)
            cout <<z[i] << " ";
        cout <<z[0];
    }
    else {
        cout << "No"<<'\n';
        for(int i = k-1; i > 0; i--)
            cout <<z[i] <<" ";
        cout <<z[0];
    }
    return 0;
}