1019. General Palindromic Number (20)

#include <iostream>
#include <vector>

using namespace std;

int main()
{
	int n, b;
	scanf("%d%d", &n, &b);

	if(n == 0)
	{
		printf("Yes\n0\n");
		return 0;
	}

	vector<int> v;
	while(n > 0)
	{
		v.push_back(n % b);
		n /= b;
	}

	int flag = 1, i, size = v.size(), r = size / 2 - 1;
	for(i = 0; i <= r; i++)
	{
		if(v[i] != v[size - i - 1])
		{
			flag = 0;
			break;
		}
	}

	if(flag == 0)
	{
		printf("No\n");
	}
	else
	{
		printf("Yes\n");
	}

	for(i = size - 1; i >= 0; i--)
	{
		if(i != size - 1)
		{
			printf(" ");
		}

		printf("%d", v[i]);
	}

	printf("\n");

	system("pause");
	return 0;
}