PAT:1019 General Palindromic Number (20分)（进制转换）

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​​

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

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

鸣谢网友“CCPC拿不到牌不改名”修正数据！

这道题还是比较简单的，只要将进制转换后再判断是否是回文数即可

#include
#include
#include
using namespace std;
int main()
{
  int a,b;
  scanf("%d %d",&a,&b);
  int arr[40],index=0;
  while(a)
  {
      arr[index++]=a%b;
      a=a/b;
  }
  int flag=1;
  for(int i=0;i=0;i--)
  {
      if(i==index-1) printf("%d",arr[i]);
      else printf(" %d",arr[i]);
  }
  if(index==0) printf("0");
  return 0;
}