PAT 1019
来源:互联网 发布:aes加密原理及算法 编辑:程序博客网 时间:2024/04/30 02:32
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 (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 2Sample Output 1:
Yes1 1 0 1 1Sample Input 2:
121 5Sample Output 2:
No4 4 1
这题没什么好说的吧。代码
1 #include <stdio.h> 2 3 int N2a(int*,int,int); 4 int isPalindromic(int *,int); 5 6 int main() 7 { 8 int N,b; 9 int a[50];10 while(scanf("%d%d",&N,&b) != EOF){11 int len = N2a(a,N,b);12 int flag = isPalindromic(a,len);13 if(flag)14 printf("Yes\n");15 else16 printf("No\n");17 int i;18 if(len>0)19 printf("%d",a[len-1]);20 for(i=len-2;i>=0;--i){21 printf(" %d",a[i]);22 }23 printf("\n");24 }25 return 0;26 }27 28 int N2a(int *a,int N,int base)29 {30 int i = 0;31 if(N < 0)32 return -1; 33 else if(N == 0){34 a[0] = 0;35 return 1;36 }37 while(N){38 a[i++] = N % base;39 N /= base;40 }41 return i;42 }43 44 int isPalindromic(int *a,int len)45 {46 int i = 0,n = len / 2;47 while(i < n){48 if(a[i] != a[len - 1 - i]){49 return 0;50 }51 ++i;52 }53 return 1;54 }
- pat 1019
- pat 1019
- pat 1019
- PAT 1019
- PAT 1019
- pat 1019
- PAT 1019
- PAT 1019
- pat basic level 1019
- PAT(A) 1019
- PAT Advanced 1019
- PAT(甲级)1019
- PAT 1019 数字黑洞
- PAT 1019数字黑洞
- PAT乙级1019
- PAT甲级1019
- PAT-甲级-1019
- PAT 1019 数字黑洞
- PAT 1015
- PAT 1016
- PAT 1017
- Jordan Lecture Note-9: Principal Components Analysis (PCA).
- PAT 1018
- PAT 1019
- PAT 1020
- Jordan Lecture Note-10: Kernel Principal Components Analysis (KPCA).
- C++连接mysql数据库的两种方法
- PAT 1021
- Jordan Lecture Note-11: 典型相关分析(Canonical Correlation Analysis, CCA).
- 王道论坛研究生机试练习赛(二)
- Jordan Lecture Note-12: Kernel典型相关分析(Kernel Canonical Correlation Analysis, KCCA).
- 这是矩阵么? (二)