题目
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 N N>0 in base b b b≥2, where it is written in standard notation with k k k+1 digits a i a_i ai as ∑ i = 0 k \sum_{i=0}^k ∑i=0k ( a i b i a_ib^i aibi). Here, as usual, 0≤ a i a_i ai< b b b for all i i i and a k a_k ak is non-zero. Then N N N is palindromic if and only if a i a_i ai= a k − i a_{k−i} ak−i for all i i i. Zero is written 0 in any base and is also palindromic by definition.
Given any positive decimal integer N N N and a base b b b, you are supposed to tell if N N N is a palindromic number in base b b b.
Input Specification:
Each input file contains one test case. Each case consists of two positive 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
N
N is a palindromic number in base
b
b
b, or No
if not. Then in the next line, print
N
N
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
题目大意
给出一个十进制数N及其一个表示进制的数b,判断在该进制下表示的数N经过反转后,其形式否与原来的数一样。
思路
先将原来的数N用该进制b表示(考虑到进制是可以多位数的……所以不方便用字符串了,将数字N的表示改为vector形式),然后将vector反转判断是否相等即可。
代码
#include<bits/stdc++.h>
using namespace std;
int main(int argc, const char * argv[]) {
int N, b;
cin>>N>>b;
vector<int> v1,v2;
string s = "", s1;
if(N == 0){
printf("Yes\n0");
return 0;
}
while(N != 0){
v1.push_back(N%b);
N/=b;
}
v2 = v1;
reverse(v1.begin(), v1.end());
if(v1 == v2) printf("Yes\n");
else printf("No\n");
for(int i=0; i<v1.size(); i++)
printf("%s%d",i==0?"":" ", v1[i]);
return 0;
}