A1019. 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 a_i as the sum of (a_ibⁱ) 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⁹ is the decimal number and 2 <= b <= 10⁹ 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₀". 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

 #include<cstdio>
 #include<iostream>
 using namespace std;
 int main(){
     int N, b, m[], len = ;
     int tag = ;
     scanf("%d%d", &N, &b);
     do{
         m[len++] = N % b;
         N = N / b;
     }while(N != );
     for(int i = , j = len - ; i <= j; i++, j--){
         if(m[i] != m[j]){
             tag = ;
             break;
         }
     }
     if(tag == )
         printf("Yes\n");
     else
         printf("No\n");
     printf("%d", m[len - ]);
     for(int i = len - ; i >= ; i--)
         printf(" %d", m[i]);
     cin >>N;
     return ;

 }

总结：

1、进制转换a进制转b进制时，先转为10进制，再转为b进制。将10进制转为b进制时采用除基取余法，将数字N不断除以基，余数作为结果的低位存储，商则循环除基，直到商为0。输出结果时，最后得到的为最高位。

2、除基取余法最好使用do while循环，因为有可能被除数为0。