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 the sum of (ai
bi
) for i from 0 to k.  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 non-negative 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 non-negative 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.


输出描述:

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.

输入例子:

27 2

输出例子:

Yes

1 1 0 1 1

#include<iostream>
#include<string>
#include<stdio.h>
using namespace std;

int main()
{
	int n, b;
	cin >> n >> b;
	if(n==0) {
	cout<<"Yes"<<endl;
	cout<<"0"<<endl;
	return 0;
}
	int a[50],j=0;
	for (int i = n; i>0; i =i/ b,j++)
	{
		a[j] = i%b;
		//cout<<i<<endl;   
	}
	if (j % 2 == 0)
	{
		cout << "No" << endl;
		bool flag = false;
		for (int i = j - 1; i >= 0; i--)
		{
			if (flag)
			{
				cout << " "<<a[i];
			}
			else
			{
				cout <<a[i];
				flag = true;
			}
			
		}
	}

	else
	{
		bool flag = false;
		for (int i = (j-1)/2; i>0; i--)
		{
			if (a[ (j-1)/2- i] != a[ (j-1)/2 + i])
			{
				flag = true;
			}
		}
		if (!flag)
		{
			bool flag1 = false;
			cout << "Yes" << endl;
			for (int i = j - 1; i >= 0; i--)
			{
				if (flag1)
				{
				cout << " "<<a[i];
				}
				else
				{
					cout << a[i];
					flag1 = true;
				}

			}
		}
		else
		{
			bool flag1 = false;
			cout << "No" << endl;
			for (int i = j - 1; i >= 0; i--)
			{
				if (flag1)
				{
					cout << " "<<a[i];
				}
				else
				{
				cout << a[i];
					flag1 = true;
				}

			}
		}
	}
	return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值