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 a_i as the sum of (a_ibⁱ) for i from 0 to k. Here, as usual, 0 <= a_i < b for all i and a_k is non-zero. Then N is palindromic if and only if a_i = a_k-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 <= 10⁹ is the decimal number and 2 <= b <= 10⁹ 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 "a_k a_k-1 ... a₀". 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<stdio.h>
int m[100000];
int main(){int a,b,i=0,j,k;scanf("%d %d",&a,&b);do{                  //转换进制典型方法要牢记 m[i++]=a%b;a/=b;}while(a!=0);for(j=0,k=i-1;j<=k;j++,k--){   //典型方法应牢记 if(m[j]!=m[k]){printf("No\n");break;}}if(j>k){printf("Yes\n");}for(j=i-1;j>0;j--){      //解决pat中常出现的不要结尾空格的方法 printf("%d ",m[j]);}printf("%d",m[j]);return 0;
}

浙大PAT甲级1019. General Palindromic Number (20)相关推荐

PAT甲级1019 General Palindromic Number：[C++题解]进制位、回文数、vector来做
文章目录题目分析题目链接题目分析 ac代码 #include<bits/stdc++.h> using namespace std;//判回文数 bool check(vector& ...
1019 General Palindromic Number (20分)_18行代码AC
立志用最少的代码做最高效的表达 PAT甲级最优题解-->传送门 A number that will be the same when it is written forwards or bac ...
1019. General Palindromic Number (20)
题目连接:https://www.patest.cn/contests/pat-a-practise/101 原题如下: A number that will be the same when it ...
【PAT甲级 BigInteger】1019 General Palindromic Number (20 分) Java版 7/7通过
题目一开始只使用了Long,有后面四个测试点过不去,后来换了BigInteger,就通过了. 这题用Java的BigInteger做,可以操作任意长度的数字,感觉有一点取巧了. 如果C或者C++的话 ...
【PAT甲级进制转换】1019 General Palindromic Number (20 分) Java版 7/7通过
题目这道题可以说是非常友善了,说白了是个水题.题目没什么坑,一次通过,主要思想就是: 输入两个数:num和base 将num按照base进制转换,得到arr 判断arr是否是一个回文数,并且输出这个 ...
【PAT - 甲级1024】Palindromic Number (25分)（大数，模拟）
题干: A number that will be the same when it is written forwards or backwards is known as a Palindromi ...
浙大PAT甲级1027. Colors in Mars (20)
1027. Colors in Mars (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue People ...
1019 General Palindromic Number
代码如下: 1 #include<iostream> 2 3 using namespace std; 4 int jishu = 0; 5 int stem[50000] = {0}; ...
18年春季第一题 PAT甲级 1144 The Missing Number (20分) 上限感很重要
Given N integers, you are supposed to find the smallest positive integer that is NOT in the given li ...

浙大PAT甲级1019. General Palindromic Number (20)

1019. General Palindromic Number (20)

浙大PAT甲级1019. General Palindromic Number (20)相关推荐

最新文章

热门文章