【PAT 甲级】1019 General Palindromic Number (20 分)

最新推荐文章于 2022-07-13 12:09:40 发布

刘小花Crystal

最新推荐文章于 2022-07-13 12:09:40 发布

阅读量158

点赞数

分类专栏： PAT甲级文章标签： PAT C++

本文链接：https://blog.csdn.net/CrystalXueNing/article/details/95639618

版权

PAT甲级专栏收录该内容

20 篇文章 0 订阅

订阅专栏

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 ai as ∑i=0k(aibi). Here, as usual, 0≤ai<b for all i and ak is non-zero. Then N is palindromic if and only if ai=ak−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.

Input Specification:

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

Output Specification:

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 "ak ak−1 ... a0". Notice that there must be no extra space at the end of output.

Sample Input 1:

27 2

Sample Output 1:

Yes
1 1 0 1 1

Sample Input 2:

121 5

Sample Output 2:

No
4 4 1

我的思路

虽然一开始一堆英文我也不认识，但是看测试数据，大概猜出来要把N（十进制数）转换成 b进制数，然后判断是不是回文数，即是不是对称的。

另外，0<N≤109 ，2≤b≤109 ，我并不能判断出用来存放转换后的数据的数组的大小，所以就随便试了，反正例子过了。

我的代码

#include <cstdio>
int main()
{
	int N, b, i=0;
	int a[1000]={0};
	bool flag = true;
	scanf("%d %d", &N, &b);
	
	if (N==0)
	{  //如果N是0，直接输出并结束。 
		printf("Yes\n0"); 
		return 0;
	} 
	
	//进制转换 
	while(N!=0)
	{
		a[i] = N%b;
		N = N/b;
		i++;
	}
	
	//判断是否对称
	int t;
	if (i%2==0)
	{
		t = i;  //偶数个 
	} else {
		t = i-1;  //奇数个
	} 
	for (int j=0; j<t/2; j++)
	{
		if(a[i-1-j]!=a[j])
		{  //不对称 
			flag = false;
			break;
		}
	}
	
	//输出
	if (flag) printf("Yes\n");
		else printf("No\n");
		
	for(int j=i-1; j>=0; j--)
	{
		printf("%d", a[j]);
		if (j!=0) printf(" ");
	}
	
	return 0;
 }