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
N>0
N>0 in base
b
≥
2
b≥2
b≥2, where it is written in standard notation with
k
+
1
k+1
k+1 digits
a
i
a_i
ai as
∑
i
=
0
k
(
a
i
b
i
)
∑_{i=0}^{k}(a_ib_i)
∑i=0k(aibi). Here, as usual,
0
≤
a
i
<
b
0≤a_i<b
0≤ai<b for all i and
a
k
a_k
ak is non-zero. Then N is palindromic if and only if
a
i
a_i
ai=
a
k
−
i
a_{k−i}
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
≤
1
0
9
0<N≤10^9
0<N≤109 is the decimal number and
2
≤
b
≤
1
0
9
2≤b≤10^9
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. Then in the next line, print N as the number in base b in the form "
a
k
a_k
ak
a
k
−
1
a_{k−1}
ak−1 …
a
0
a_{0}
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
解析
这题首先要进行进制转换,再判断是否为回文数字。
进制转换代码:(可以看看我的这篇blog算法笔记)
这里进制转换不能把结果放在string里,因为题目给的2<=base<=
1
0
9
10^9
109。如果是17进制,怎么表示16?。题目好像默认是什么就放什么,是16,就放16.。所以要用vector<int>存储每一位。
判断回文应该没问题
Code:
#include <stdio.h>
#include <vector>
using namespace std;
bool ispalindromic(const vector<int> &number) {
for (int i = 0; i < number.size() / 2; i++) {
if (number[i] != number[number.size() - i - 1])
return false;
}
return true;
}
int main()
{
int number, D;
scanf("%d %d", &number, &D);
vector<int> result;
do {
result.push_back(number%D);
number /= D;
} while (number);
printf("%s\n",ispalindromic(result)?"Yes":"No");
for (auto it = result.crbegin(); it != result.crend(); it++)
printf("%d%c", *it, it + 1 == result.crend() ? '\n' : ' ');
}