1019 General Palindromic Number (20分)

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
const int maxn = 100001;


int main()
{
    freopen("1.txt","r",stdin);
    int d,b;
    cin>>d>>b;
    int num[maxn];
    int ind = 0;
    while(d>0)
    {
        num[ind++] = d%b;
        d/=b;
    }
    int flag = 0;
    for(int i = 0;i<ind/2;i++)
    {
        if(num[i] != num[ind - i - 1])
        {
            flag = 1;
            break;
        }
    }

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