PAT 甲级 1019 General Palindromic Number (20 分)

题目描述

A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers.
Although palindromic numbers are most often considered in the decimal system, the concept of palindromicity can be applied to the natural numbers in any numeral system. Consider a number N>0 in base b≥2, where it is written in standard notation with k+1 digits $a_i$ as ${\sum }_{i=0}^k(a_i{b}^i).$Here, as usual, 0≤ai <b for all i and $a_k$ is non-zero. Then N is palindromic if and only if ai=$a_{k-i}$ for all i. Zero is written 0 in any base and is also palindromic by definition.
Given any positive decimal integer N and a base b, you are supposed to tell if N is a palindromic number in base b.

输入

Each input file contains one test case. Each case consists of two positive numbers N and b, where $0<N\le 10^9$ is the decimal number and 2≤b≤$10^9 is the base. The numbers are separated by a space.

输出

For each test case, first print in one line Yes if N is a palindromic number in base b, or No if not. Then in the next line, print N as the number in base b in the form “$a_k{a}_{k-1}...a_0$”. Notice that there must be no extra space at the end of output.

思路

看题目说了一大堆其实就是给出一个十进制数字，给出一个要转的进制，把这个数转为对应进制，然后看这个数是不是对成的即可。

代码

#include<iostream>
#include<cstdio>
#include<vector>
#include<stdlib.h>
using namespace std;
vector<int> ans;
int main()
{
	int N, r;
	cin >> N >> r;
	while (N)
	{
		ans.push_back(N % r);
		N = N / r;
	}
	int t = ans.size();
	int i = 0;
	int j = t - 1;
	int flag = 0;
	while (i < j)
	{
		if (ans[i] != ans[j])
		{
			flag = 1;
			break;
		}
		i++;
		j--;
	}
	if (flag == 0)
		printf("Yes\n");
	else
		printf("No\n");
	for (i = t - 1; i >= 0; i--)
	{
		printf("%d", ans[i]);
		if (i > 0)
		{
			printf(" ");
		}
	}
	cout << endl;
}