1019. General Palindromic Number (20)

#include <string>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> result;
void change(long int a,long int b)
{
	int tmp;
	while(a){
	tmp=a%b;
	result.push_back(tmp);
    a/=b;
	}
}
bool isPalindromic(vector<int> result)
{
	vector<int> rec;
	rec=result;
	reverse(rec.begin(),rec.end());
	int i;
	for( i=0;i<result.size();i++)
	{
		if(result[i]!=rec[i])
		{
		 return false;
		 break;
		}
	}
	if(i==result.size())
		return true;
}


int main()
{
	long int a;
	long int b;
	cin>>a>>b;
	if(a==0)
	{printf("Yes\n");
	printf("0");
	}
	else
	{
	change(a,b);
	if(isPalindromic(result)==true)
		cout<<"Yes"<<endl;
	else
		cout<<"No"<<endl;
	for(int i=result.size()-1;i>0;i--)
	{
		printf("%d ",result[i]);
	}
	printf("%d",result[0]);
	}
}