题目描述
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(aibi). Here, as usual, 0≤i <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
9
is the decimal number and 2≤b≤10
9
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−1
… a
0
". 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
题目要求
这里的要求其实是要求一串数字在给定的进制下是否为回文,比较简单,注意判断回文时看头指针最后是否大于尾指针,如果大于,则为回文,否则不是
AC代码
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int b_digit[10000];
int main(){
int i = 0, n, b;
scanf("%d%d", &n,&b);
while(n){
b_digit[i++] = n % b;
n /= b;
}
int head = 0, tail = i-1;
for(int j = 0; j < i / 2; j++){
//printf("%d\n", b_digit[j]);
if(b_digit[head] == b_digit[tail]){
head++;
tail--;
}
}
if(head >= tail) printf("Yes\n"); //这里的条件是head>=tail而不是head==tail,因为这样如果位数为双数的话则会出现错误
else printf("No\n");
//printf("%d\n", i );
for(int k = i - 1; k >=0; k--){
//printf("%d", k);
if(k == 0) printf("%d", b_digit[k]);
else
printf("%d ", b_digit[k]);
}
return 0;
}