PAT-A-1019. General Palindromic Number (20)
2017-04-03 23:30
537 查看
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
提交代
码
doglovecow [编辑资料] [登出]
主页
题目集
基本信息
题目列表
提交列表
排名
帮助
查看源代码
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 | #include<iostream> #include<cstdio> using namespace std; int main() { int n, base; int a[30] = { 0 }; int num = 0; cin >> n >> base; while (n != 0) { a[++num] = n%base; n = n / base; } int flag = 1; for (int i = 1; i <= num / 2; i++) { if (a[i] != a[num - i + 1]) { flag = 0; break; } } if (flag) cout << "Yes" << endl; else cout << "No" << endl; cout << a[num]; for (int i = num-1; i >=1; i--) { cout << " " << a[i]; } system("pause"); return 0; } |
查看提交
相关文章推荐
- PAT_A 1019. General Palindromic Number (20)
- PAT 1019. General Palindromic Number (20)(是否以d进制对称)
- 浙江大学PAT_甲级_1019. General Palindromic Number (20)
- pat甲级1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)-PAT
- PAT (Advanced Level)1019. General Palindromic Number (20) 栈 进制转换(简)
- PAT 1019 General Palindromic Number (20)
- 浙大 PAT Advanced level 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)——PAT (Advanced Level) Practise
- PAT(甲级)1019. General Palindromic Number (20)
- PAT(A) - 1019. General Palindromic Number (20)
- PAT甲级真题及训练集(12)--1019. General Palindromic Number (20)
- PAT: 1019. General Palindromic Number (20)
- 【PAT】A1019. General Palindromic Number (20)
- PAT-A 1019. General Palindromic Number (20)
- 【PAT】1019. General Palindromic Number (20)
- [PAT]1019. General Palindromic Number (20)@Java
- PAT (Advanced Level) 1019. General Palindromic Number (20)
- PAT 1019. General Palindromic Number (20) 回文数简单题
- pat 1019. General Palindromic Number (20)