顽强的小白
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>0N > 0N>0 in base b≥2b \ge 2b≥2, where it is written in standard notation with k+1k+1k+1 digits aia_iai as ∑i=0k(aibi)\sum_{i=0}^k (a_ib^i)∑i=0k(aibi). Here, as usual, 0≤ai<b0 \le a_i < b0≤ai<b for all iii and aka_kak is non-zero. Then NNN is palindromic if and only if ai=ak−ia_i = a_{k-i}ai=ak−i for all iii. Zero is written 0 in any base and is also palindromic by definition.Given any positive decimal integer NNN and a base bbb, you are supposed to tell if NNN is a palindromic number in base bbb.
Input Specification:
Each input file contains one test case. Each case consists of two positive numbers NNN and bbb, where 0<N≤1090 < N \le 10^90<N≤109 is the decimal number and 2≤b≤1092 \le b \le 10^92≤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 NNN is a palindromic number in base bbb, or No if not. Then in the next line, print NNN as the number in base bbb in the form “aka_kak ak−1a_{k-1}ak−1 … a0a_0a0”. 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 <cstring>
using namespace std; int isPalin(int num[],int len){
for(int i=0;i<len/2;++i){
if(num[i]!=num[len-1-i]){
return 0;
}
}
return 1;
}int main(){
int num[1000];
int n,base;
scanf("%d %d",&n,&base);
int i=0,first=1;
while(n!=0){ //常用的转换进制的小模板
num[i++]=n%base;
n=n/base;
}
if(isPalin(num,i)) printf("Yes\n");
else printf("No\n");
for(int j=i-1;j>=0;--j ){
if(first){
first=0;
}else{
printf(" ");
}
printf("%d",num[j]);
}
}