PTA甲级 1019 General Palindromic Number (C++)

最新推荐文章于 2023-02-03 09:39:15 发布

负反馈循环

最新推荐文章于 2023-02-03 09:39:15 发布

阅读量59

点赞数

分类专栏： PTA

本文链接：https://blog.csdn.net/qq_43659183/article/details/119642007

版权

c++ oj系统

PTA 专栏收录该内容

148 篇文章 2 订阅

订阅专栏

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 \geq 2$ , where it is written in standard notation with $k + 1$ digits $a_i$ as $_{i=0}^k (a_ib^i)$ . Here, as usual, $0≤a_i<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<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

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-12 13:05:08
// All rights reserved.

#include <iostream>
#include <vector>

using namespace std;

int main(){
    int n, b, len = 0;
    bool isPali = true;
    cin >> n >> b;

    vector<int> radixB;

    while(n != 0){
        int shang = n / b;
        int yushu = n % b;

        radixB.push_back(yushu);
        len++;

        n = shang;
    }
    // radixB 里面是倒序

    for(int i = 0; i < len / 2; ++i){
        if(radixB[i] != radixB[len - i -1]){
            isPali = false;
            break;
        }
    }

    if(isPali) printf("Yes\n");
    else printf("No\n");

    for(int i = 0; i < len - 1; ++i) printf("%d ", radixB[len - i - 1]);
    printf("%d\n", radixB[0]);

    return 0;
}