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 aias ∑i=0k (ai bi). 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 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^9is the decimal number and 2≤b≤10 ^9is 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
kak−1… a0
". 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
思路:题目很简单,就是一开始别用string,那样会误入歧途,折磨到怀疑人生。因为我就是用了string,再这道题上花了半个多小时。
举个简单的例子,如果进制大于10了,比如 16 进制,我们任意得到一个16进制数
112121 注意了,如果我们用的是string,会判断这个结果不是回文数,因为(1= =1 1!=2,2!=1)但实际上呢,用真正的16进制表示,
它是1CC1(1= =1,C= =C);它是一个回文数,所以只要你没用string,一般就能得到正确的结果了。
#include<iostream>
using namespace std;
int palindromic[40];
int lenth=0;
bool ispalindromic()
{
for (int i = 0; i < lenth/2; i++)
if (palindromic[i] != palindromic[lenth -1- i])
return false;
return true;
}
void anyradix(int a,int b)
{
do
{
palindromic[lenth++] = a % b;
a /= b;
} while (a);
}
int main()
{
int m, n;
cin >> m >> n;
anyradix(m, n);
if (ispalindromic())
cout << "Yes" << endl;
else
cout << "No" << endl;
for (int i = lenth-1; i >=0; i--)
{
if (i ==lenth-1)
cout << palindromic[i];
else
cout << " " << palindromic[i];
}
return 0;
}