PAT-甲级-1019

来源:互联网 发布:宁波指动网络董事长 编辑:程序博客网 时间:2024/05/29 17:16

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 2
Sample Output 1:
Yes1 1 0 1 1
Sample Input 2:
121 5
Sample Output 2:
No4 4 1
【解析】这道题之前一直有一个测试点通不过其实就是a为0的情况,所以我们需要加一个判断,判断a是否为0如果为0就输出0
#include<cstdio>#include<iostream>#include<string>using namespace std;int c[100010];int main(){int a,b,i=0,j,k,flag=0;scanf("%d%d",&a,&b);while(a!=0){c[i++]=a%b;a/=b;flag=1;}     if(flag==0)        c[i++]=0; for(j=0,k=i-1;j<=k;j++,k--){if(c[j]!=c[k]){printf("No\n");break;}}if(j>k){printf("Yes\n");}for(j=i-1;j>=0;j--){        if(j==i-1)printf("%d",c[j]);         else            printf(" %d",c[j]);}return 0;}

0 0
原创粉丝点击