PTA甲级 1019 General Palindromic Number（C++）

准大二小白在学技术的同时每天至少一道算法题，以此督促自己，共勉！

1019 General Palindromic Number

分数 20

全屏浏览题目

切换布局

作者 CHEN, Yue

单位 浙江大学

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 ai​ as ∑i=0k​(ai​bi). Here, as usual, 0≤ai​<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≤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 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 "ak​ ak−1​ ... 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

鸣谢网友“CCPC拿不到牌不改名”修正数据！

代码长度限制

16 KB

时间限制

400 ms

内存限制

64 MB

#include<bits/stdc++.h>
using namespace std;
const int N=100010;
int digit[N],n,b,sum,temp;
int palindromic(int a[],int num){
    int j=0;
    while(a[j]==a[num]&&j<num){
        j++;
        num--;
    }
    
    if(j==num)return 1;
    else return 0;
}
int main(){
    cin>>n>>b;
    int i=0;
    while(n!=0){
        digit[i++]=n%b;
        n/=b;
    }
    i--;
    if(palindromic(digit,i)){
        printf("Yes\n");
    }
    else printf("No\n");
    for(;i>=0;i--){
        printf("%d",digit[i]);
        if(i!=0){
            printf(" ");
        }
    }
    return 0;
}