# 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) 时间限制 400 ms 内存限制 32000 kB 代码长度限...
• IAccepted
• 2014年03月04日 14:44
• 1590

## 浙大 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...
• fanxingzju
• 2016年05月13日 18:04
• 154

## 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...
• zjujqq
• 2013年08月29日 14:18
• 502

## 1019. General Palindromic Number

http://pat.zju.edu.cn/contests/pat-a-practise/1019 // 0应特殊处理 // 进制转换，对称性 #include #define SI...
• Staibin
• 2014年03月10日 15:05
• 471

## [PAT]1019. General Palindromic Number (20)@Java

1019. General Palindromic Number (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限...
• zjkC050818
• 2017年10月16日 20:10
• 79

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

• lambsnow
• 2016年10月14日 13:33
• 113

## PAT(A) - 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...
• flx413
• 2016年09月25日 15:46
• 127

## PAT_A 1019. General Palindromic Number (20)

1019. General Palindromic Number (20)A number that will be the same when it is written forwards or b...
• scylhy
• 2017年02月09日 11:40
• 132

## 【PAT】1019. General Palindromic Number (20)

• realxuejin
• 2013年08月21日 16:15
• 1013

## PAT (Advanced) 1019. General Palindromic Number (20)

• cx86918626
• 2017年09月23日 22:56
• 37

举报原因： 您举报文章：1019. General Palindromic Number (20) 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)