1019 General Palindromic Number (20分)

最新推荐文章于 2021-02-18 10:58:51 发布

李小白~

最新推荐文章于 2021-02-18 10:58:51 发布

阅读量108

点赞数 1

分类专栏： PAT（甲级）

本文链接：https://blog.csdn.net/qq_40941722/article/details/104004772

版权

PAT（甲级）专栏收录该内容

130 篇文章 10 订阅

订阅专栏

该博客介绍了如何判断一个十进制数在给定的基数下是否为回文数。提供了输入输出规范及样例，并解释了如何将数转化为给定基数的表示形式。

摘要由CSDN通过智能技术生成

题目

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\lt0$ in base $b\ge24$ , where it is written in standard notation with $k + 1$ digits $a_i$ as $\sum_{i=0}^{k}(a_ib^i)$ . Here, as usual, $0\le a_i\lt b$ for all $i$ and $a_k$ is non-zero. Then $N$ is palindromic if and only if $a_i =a_{k−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\lt N\le10^9$ is the decimal number and $2\le b\le10^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_ka_{k−1}\cdots 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

题目大意

给定正整数 $N$ ，给定基数 $b$ ，将 $N$ 转换成 $b$ 进制数，并判断这个 $b$ 进制数是否是首尾对称的，唯一需要留意的就是数据范围的问题，可以通过INT_MAX查看int的数据范围，结果为2147483647，即为 $2^{31}$ （4个字节，其中有一个符号位），而题目中的 $10^9$ 在int范围内，故只需用int表示即可。

代码

#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;

int main(){
    int n, b;
    vector<int> vec;
    scanf("%d%d", &n, &b);
    while(n){ 	//进制转换
        vec.push_back(n%b);
        n /= b;
    }
    bool flag = true;
    int t = vec.size();
    for(int i=0; i<t/2; i++)	//判断首位是否相等
        if(vec[i] != vec[t-i-1]){
            flag = false;
            break;
        }
    if(flag)
        cout<<"Yes"<<endl;
    else
        cout<<"No"<<endl;
    for(int i=vec.size()-1; i>=0; i--){
        cout<<vec[i];
        if(i)
            cout<<" ";
    }
    return 0;
}