PAT刷题记录 1019. General Palindromic Number (20分)

#include<iostream>

/*
	总结：主要考点在于十进制数如何转化为base进制数，用的是除留余数法
*/

using namespace std;
int num, base;

int main() {
	cin >> num >> base;
	int a[100];
	int cnt = 0;
	do {
		a[cnt++] = num % base;
		num= num / base;
	} while (num != 0);
	bool flag = true;
	for (int i = 0; i <= cnt/2; i++) {
		int low = i, high = cnt - i - 1;
		if (a[low] == a[high])continue;
		else {
			flag = false;
			break;
		}
	}
	if (flag)printf("Yes\n");
	else printf("No\n");
	for (int i = cnt-1; i >=0; i--) {
		printf("%d", a[i]);
		if (i != 0)printf(" ");
	}
	system("pause");
	return 0;
}