1019. General Palindromic Number (20)

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>

#include <cstring>
#include <string>
#include <queue>
#include <vector>

using namespace std;

int n,b;
int z[105],num=0;

void change()//转换进制模板，其中num是转换之后的位数
{
    do
    {
        z[num++]=n%b;
        n=n/b;
    }while(n!=0);
}
bool judge(int z[],int num)
{
    for(int i=0;i<num/2;i++)
    {
        if(z[i] != z[num-1-i])
            return false;
    }

    return true;
}
void pr()//打印
{
    for(int i=num-1;i>=0;i--)
    {
        if(i==num-1)
            printf("%d",z[i]);
        else
            printf(" %d",z[i]);
    }
}
int main()
{
   // freopen("in.txt","r",stdin);

    scanf("%d %d",&n,&b);
    change();
    if(judge(z,num))
    {
        printf("Yes\n");
        pr();
    }
    else
    {
        printf("No\n");
        pr();
    }

    return 0;
}