PAT (Advanced Level)1019. General Palindromic Number (20) 栈 进制转换（简）

题目链接

和115题类型相同，简单题

//1019. General Palindromic Number(20)

#include <iostream>
#include <stack>
using namespace std;

int main() {
	int a, b, i;
	stack<int> st;
	cin >> a >> b;
	int c[15];
	int sub = 0;
	while (a != 0) {
		c[sub++] = a % b;
		a /= b;
	}
	for (i = 0; i < sub / 2; i++)  st.push(c[i]);
	if (sub % 2 != 0) i++;
	for (i; i < sub; i++) if (st.top() == c[i]) { st.pop(); continue; }
	else break;
	if (i >= sub) {
		cout << "Yes" << endl;
		cout << c[sub - 1];
		for (i = sub - 2; i >= 0; i--) cout << " " << c[i];
		cout << endl;
	}
	else {
		cout << "No" << endl;
		cout << c[sub - 1];
		for (i = sub - 2; i >= 0; i--) cout << " " << c[i];
		cout << endl;
	}
	return 0;
}