PAT 甲级 1019 General Palindromic Number(简单题)

原创 2016年05月30日 17:50:28

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 <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <stdio.h>
#include <math.h>

using namespace std;
int n,b;
int a[10005];
int cnt;
void dfs(int n,int b)
{
  if(n<b)
  {
    a[cnt++]=n;
    return;
  }
  dfs(n/b,b);
  a[cnt++]=n%b;
}
int main()
{
  while(scanf("%d%d",&n,&b)!=EOF)
  {
    cnt=0;
    dfs(n,b);
    int i=0,j=cnt-1;
    int ans=0;
    while(i<=j)
    {
           if(a[i]!=a[j])
       {
         ans=-1;
         break;
       }
       i++,j--;
    }
    if(ans==-1)
      printf("No\n");
    else
      printf("Yes\n");
    for(int i=0;i<cnt;i++)
    {
      if(i==cnt-1)
        printf("%d\n",a[i]);
      else
          printf("%d ",a[i]);
    }
    
  }
  return 0;

}


版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

PAT Basic 1019. 数字黑洞 (20)

http://pat.zju.edu.cn/contests/pat-b-practise/1019

浙大 PAT 1019. General Palindromic Number (20)

1019. General Palindromic Number (20) 时间限制 400 ms 内存限制 32000 kB 代码长度限...

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

PAT 1019. 数字黑洞

#include                                         ...

PAT 甲级 1019. General Palindromic Number

原题传送门 进制转换 两个int数组的比较 #include using namespace std;int b[100] = {0}; int digit_count = 0; int c[100...

浙江大学PAT_甲级_1019. General Palindromic Number (20)

C++ stack vector

PAT: 1019. General Palindromic Number (20)

1019. General Palindromic Number (20) A number that will be the same when it is written forwards or...

【PAT】1019. General Palindromic Number (20)

题目:http://pat.zju.edu.cn/contests/pat-a-practise/1019 简单题。将十进制数a转换成以b为奇数的数,判断转换后的数是否是符合回文串的特点。 A...

PAT A 1019.General Palindromic Number (20)

题目

1019. General Palindromic Number (20)——PAT (Advanced Level) Practise

题目信息1019. General Palindromic Number (20)时间限制400 ms 内存限制65536 kB 代码长度限制16000 B A number that will...

PAT A1019 General Palindromic Number

//ac了,自己做的,但是注意末尾无空格的处理只有一行参考了书。另外输出那里可以更简洁,因为注意到无论是还是不是,都要输出进制形式的 //break是跳出最内层的循环(while,for)或switc...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)