1019. General Palindromic Number (20)

题目链接：https://www.patest.cn/contests/pat-a-practise/1019

水题

#include<bits/stdc++.h>
const int maxn =100010;
using namespace std;

int n,m;
int a[maxn];
int cnt=0;
int main(){
    cin>>n>>m;
    while(n){
        a[cnt++]=n%m;
        n/=m;
    }
    int flag=1;
    for(int i=0;i<cnt;i++){
        if(a[i]!=a[cnt-i-1])flag=0;
    }
    if(flag)cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    cout<<a[cnt-1];
    for(int i=cnt-2;i>=0;i--)cout<<' '<<a[i];
    cout<<endl;
    return 0;
}