A number that will be the same when it is written forwards or backwards is known as a PalindromicNumber. For example, 1234321 is a palindromicnumber. All single digit numbers are palindromicnumbers.Although palindromic numbers are most ofen considered in the decimal system, the concept ofpalindromicity can be applied to the natural numbers in any numeral system. Consider a number N > 0 inbase 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 palindromicnumber 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 <= 109 is the decimal number and 2 <= b <= 109 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. Thenin the next line, print N as the number in base b in the form “ak ak-1 … a0”. Notice that there must be noextra 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
题⽬⼤意:
给出两个整数a和b,问⼗进制的a在b进制下是否为回⽂数。是的话输出Yes,不是输出No。并且输出a在b进制下的表示,以空格隔开
分析:
将a转换为b进制形式,保存在int的数组⾥⾯,⽐较数组左右两端是否对称。
注意:如果是0,要输出Yes和0
//1019 General Palindromic Number (20分)
#include <iostream>
using namespace std;
int n,b;
int array[10000];
int len=0;
void dtor(int d,int radix)
{
string str;
do
{
array[len++]=d%radix;
d=d/radix;
}while(d!=0);
}
bool isPalin()
{
int i=0,j=len-1;
while(i<j)
{
if(array[i]!=array[j])
return false;
i++;
j--;
}
return true;
}
int main()
{
cin>>n>>b;
dtor(n,b);
cout<<(isPalin()?"Yes":"No")<<endl;
for(int i=len-1;i>=0;i--)
{
cout<<array[i];
if(i!=0)
cout<<" ";
}
return 0;
}