General Palindromic Number (进制)

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

  1 #include <iostream>
  2
  3 using namespace std;
  4
  5
  6
  7
  8
  9 int shu[1001];
 10
 11
 12
 13 int main()
 14
 15 {
 16
 17       int n,b;
 18
 19       while(cin>>n)
 20
 21       {
 22
 23             cin>>b;
 24
 25               if(n==0)
 26
 27               {
 28
 29                 cout<<"Yes"<<endl;
 30
 31                   cout<<0<<endl;
 32
 33               }
 34
 35
 36
 37               else
 38
 39
 40
 41               {
 42
 43          int count=0;
 44
 45            int tem=n;
 46
 47           while(tem)
 48
 49          {
 50
 51            shu[count++]=tem%b;
 52
 53               tem=tem/b;
 54
 55          }
 56
 57
 58
 59           int i,j;
 60
 61         bool bb=true;
 62
 63          for(i=0,j=count-1;i<=j;i++,j--)
 64
 65             if(shu[i]!=shu[j]) bb=false;
 66
 67
 68
 69
 70
 71          if(bb) cout<<"Yes"<<endl;
 72
 73                else cout<<"No"<<endl;
 74
 75
 76
 77           bool fir=true;
 78
 79
 80
 81          for(i=count-1;i>=0;i--)
 82
 83          {
 84
 85             if(fir)
 86
 87               {
 88
 89                  fir=false;
 90
 91                   cout<<shu[i];
 92
 93               }
 94
 95               else cout<<" "<<shu[i];
 96
 97          }
 98
 99          cout<<endl;
100
101               }
102
103       }
104
105    return 0;
106
107 }
108
109  
时间: 2024-10-05 01:37:05

General Palindromic Number (进制)的相关文章

PAT 甲级 1019 General Palindromic Number (进制转换,vector运用,一开始2个测试点没过)

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. Althoug

PAT 1019 General Palindromic Number[简单]

1019 General Palindromic Number (20)(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. Altho

PAT A1019 General Palindromic Number

PAT A1019 General Palindromic Number 题目描述: 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. Altho

hdu 4937 Lucky Number ( 进制转换+枚举 )

题意: 有一个数n,问有多少个进制x(基数)使得n转换为x进制后的数字中只有3.4.5.6四个数. 算法: 对于只有一位数的情况,显然3.4.5.6都应该输出-1. 如果有2位数,假设这2位中高位为a,低位为b,进制为base,则 n = a * base + b,解一元一次方程即可. 如果有3位数,假设这3为从高到低分别为a.b.c,进制为base,则 n = a * base * base + b * base + c,即一元二次方程即可. 如果位数>= 4,可以暴力枚举进制数.base>

pat1019. General Palindromic Number (20)

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

PAT-进制转换-A1019 General Palindromic Number (20分)

题目描述: 给出两个整数n.b,问十进制整数n在b进制下是否是回文数,若是,则输出Yes:否则,输出No.在此之后输出n在b进制下的表示. 单词:Palindromic Number--回文数:decimal--十进制的. 输入格式: 输入用空格分隔的两个数,第一个数是十进制数n(0<N≤10?9),第二个数是十进制数b( 2≤b≤10?9). 输出格式: 第一行输出Yes或No,第二行输出十进制数n在b进制下的表示,用空格把每个数隔开,末尾不能有多余空格. 样例: 样例一: 输入:27 2 输

PAT1019. General Palindromic Number

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 cons

1019 General Palindromic Number (20)(20 point(s))

problem 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 of

PAT Advanced 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 cons