PAT1019

http://www.patest.cn/contests/pat-a-practise/1019

#include <iostream>
using namespace std;

void print(int *a,int digit){
	for(int i=digit-1;i>0;--i){
		cout<<a[i]<<' ';
	}
	cout<<a[0];
}

int main()
{
	int N,b,digit=0; bool is_palindromic =true;
	int a[1000]={0};
	
	cin>>N>>b;
    while(N>0){
        a[digit]=N%b;
        ++digit;
        N/=b;
    }
    
    for(int i=0;i<digit/2;++i){
    	if(a[i]!=a[digit-i-1]){
    		is_palindromic=false;
    		break;
		}
	}
	
	if(is_palindromic){
		cout<<"Yes\n";
		print(a,digit);
	}else{
		cout<<"No\n";
		print(a,digit);
	}
	return 0;
}