【PAT】1019. General Palindromic Number

注意边界数据0的输出

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

int main()
{
    int n,b;
    cin>>n>>b;
    int a[40];
    int k=0;
    int ans=n;
    while(n){
        a[k++]=n%b;
        n=n/b;
    }
    int flag=0;
    for(int i=0;i<=k/2;i++){
        if(a[i]!=a[k-i-1]) flag=1;
    }
    if(flag && ans!=0) cout<<"No"<<endl;
    else cout<<"Yes"<<endl;
    if(ans!=0){
        for(int i=k-1;i>=0;i--)
        {
            printf("%d",a[i]);
            if(i) printf(" ");
        }
    }else cout<<"0";
    return 0;
}