Day52: [PAT甲级] 1019 General Palindromic Number (20分)

Day52: [PAT甲级] 1019 General Palindromic Number (20分)

题源：

来自PAT真题库：

https://pintia.cn/problem-sets/994805342720868352/problems/994805487143337984

代码：

dirty code凑合看吧

#include<iostream>
#include<string>
#include<sstream>
#include<vector>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
using namespace std;
long long x, base;
vector<long long> F(long long x,long long base ) {
	vector<long long> res;
	for (; x != 0;) {
		long long temp = x % base;
		res.push_back(temp);
		x = x / base;
	}
	return res;
}
int main() {
	bool first = true;
	cin >> x >> base;
	if (x == 0) {
		printf("Yes\n0");
		return 0;
	}
	vector<long long> res = F(x, base);
	vector<long long> res2 = res;
	reverse(res2.begin(),res2.end());
	if (res == res2) printf("Yes\n");
	else printf("No\n");
	for (auto i : res2){
		if (first) {
			cout << i;
			first = false;
		}else
		cout <<" "<< i;
	}
	system("pause");
}