PAT甲题题解-1019. General Palindromic Number (20)-又是水题一枚

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;
const int maxn=30;
int a[maxn];
int n,b;
int main()
{
    scanf("%d %d",&n,&b);
    int cnt=0;
    int tmp=n;
    if(tmp==0){
        cnt=1;
        a[0]=0;
    }
    while(tmp){
        a[cnt]=tmp%b;
//printf("cnt:%d a:%d\n",cnt,a[cnt]);
        cnt++;
        tmp=tmp/b;
    }
    bool flag=true;
    for(int i=0;i<=cnt/2;i++){
        if(a[i]!=a[cnt-1-i]){
            flag=false;
            break;
        }
    }

    if(flag)
        printf("Yes\n");
    else
        printf("No\n");
    printf("%d",a[cnt-1]);
    for(int i=cnt-2;i>=0;i--){
        printf(" %d",a[i]);
    }
    printf("\n");
    return 0;
}