1019. General Palindromic Number (20)

原创 2015年07月09日 11:33:48

1019. General Palindromic Number (20)

时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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 (aibi) 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.

Input Specification:

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.

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

#include<vector>
#include <sstream>
#include<cmath>
#include<iomanip>
#include<iostream>
#include <ctype.h>
#include <stdlib.h>
#include <algorithm>

using namespace std;

int main()
{
	int a, b;
	cin >> a >> b;
	vector<int> num;

	int shang = a / b;
	int yushu = a%b;
	num.push_back(yushu);

	while (shang!=0)
	{		
		yushu = shang % b;
		shang = shang / b;		
		num.push_back(yushu);
	}

	if (num.size() % 2 == 0)
	{
		cout << "No" << endl;

	}
	else
	{
		int len = num.size()/2;
		int count = 0;
		for (int i = 0; i < len; i++)
		{			
			int temp = num.size()-1 - i;//注意这里是-i,并且是-1再减i。一开始这里写错了,导致耽误10分钟调试
			if (num[i] == num[temp])
			{
				count++;
			}
		}
		if (count == len)
		{
			cout << "Yes"<<endl;
		}
		else
		{
			cout << "No" << endl;
		}
	}

	for (int i = num.size()-1; i >=0; i--)//注意输出的格式调整
	{
		if (i != (num.size() - 1))
			cout << " " << num[i];
		else
		{
			cout << num[i];
		}
	}
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

PAT: 1019. General Palindromic Number (20)

1019. General Palindromic Number (20) A number that will be the same when it is written forwards or...
  • ZJFCLH
  • ZJFCLH
  • 2014年03月23日 15:53
  • 824

【PAT】1019. General Palindromic Number (20)

题目:http://pat.zju.edu.cn/contests/pat-a-practise/1019 简单题。将十进制数a转换成以b为奇数的数,判断转换后的数是否是符合回文串的特点。 A...

PAT A 1019.General Palindromic Number (20)

题目

1019. General Palindromic Number (20)——PAT (Advanced Level) Practise

题目信息1019. General Palindromic Number (20)时间限制400 ms 内存限制65536 kB 代码长度限制16000 B A number that will...

浙江大学PAT_甲级_1019. General Palindromic Number (20)

C++ stack vector

PAT (Advanced Level) 1019. General Palindromic Number (20) 检测数字在给定进制下是否回文

A number that will be the same when it is written forwards or backwards is known as a Palindromic Nu...

PAT (Advanced Level) Practise 1019 General Palindromic Number (20)

1019. General Palindromic Number (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限...

PAT 1019. General Palindromic Number (20)

1019. General Palindromic Number (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限...

pat 1019. General Palindromic Number (20)

1019. General Palindromic Number (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程...
  • wyh7280
  • wyh7280
  • 2015年07月23日 17:49
  • 216

浙大 PAT 1019. General Palindromic Number (20)

1019. General Palindromic Number (20) 时间限制 400 ms 内存限制 32000 kB 代码长度限...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:1019. General Palindromic Number (20)
举报原因:
原因补充:

(最多只允许输入30个字)