关闭

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

标签: PAT 1019General Palindromic
307人阅读 评论(0) 收藏 举报
分类:

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;

}


0
0
查看评论

浙大 PAT 1019. General Palindromic Number (20)

1019. General Palindromic Number (20) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 ...
  • IAccepted
  • IAccepted
  • 2014-03-04 14:44
  • 1590

PAT(甲级)1019

1019. General Palindromic Number (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 ...
  • Leonardo1897
  • Leonardo1897
  • 2015-09-23 17:04
  • 272

PAT甲级1019

1019. General Palindromic Number (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 ...
  • qq_22194315
  • qq_22194315
  • 2017-01-09 19:09
  • 222

【PAT】1024. Palindromic Number 回文反转相加

1024. Palindromic Number (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yu...
  • tiantangrenjian
  • tiantangrenjian
  • 2013-11-22 22:42
  • 2456

PAT 甲级 1024 Palindromic Number

PAT 甲级 1024 Palindromic Number
  • Dacc123
  • Dacc123
  • 2016-05-31 08:16
  • 204

PAT 1019 General Palindromic Number

#include #include using namespace std; int main() { vector vec; int num; int base; cin>>num>>base; int digit; if(num == 0) { cout...
  • github_24924857
  • github_24924857
  • 2015-07-05 11:05
  • 228

PAT(甲级)1024

1024. Palindromic Number (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yu...
  • Leonardo1897
  • Leonardo1897
  • 2015-09-24 19:40
  • 266

1019. 数字黑洞 (20)PAT乙级 &1069. The Black Hole of Numbers (20) PAT甲级

传送门乙级 传送门甲级 坑点:最后的表达式是有空格的#include<stdio.h> #include<algorithm>using namespace std; bool cmp(int a,int b){ return a>b; }void toAr...
  • SY_Yu
  • SY_Yu
  • 2017-01-24 16:17
  • 173

浙大PAT 1019题 1019. General Palindromic Number

#include int main(){ int i,j,n,b,cnt; int str[50]; scanf("%d %d",&n,&b); cnt=0; while(n>=b){ str[cnt]=n%b; cnt++; n=n/...
  • Sup_Heaven
  • Sup_Heaven
  • 2012-12-29 21:47
  • 582

1019 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...
  • Win_Man
  • Win_Man
  • 2016-02-27 10:30
  • 153
    个人资料
    • 访问:131220次
    • 积分:4660
    • 等级:
    • 排名:第7443名
    • 原创:349篇
    • 转载:0篇
    • 译文:0篇
    • 评论:7条
    最新评论