PAT 甲级 1019 General Palindromic Number(简单题)
来源:互联网 发布:java多线程日志输出 编辑:程序博客网 时间:2024/06/05 14:17
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
#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 甲级 1019 General Palindromic Number(简单题)
- PAT(甲级)General Palindromic Number (20)
- 1019. General Palindromic Number (20)-PAT甲级真题
- PAT甲级.1019. General Palindromic Number (20)
- 【PAT甲级】1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20) PAT 甲级
- PAT甲级1019. General Palindromic Number (20)
- PAT 甲级 1019. General Palindromic Number
- PAT甲级 1019. General Palindromic Number (20)
- [PAT-甲级]1019.General Palindromic Number
- PAT 甲级1019. General Palindromic Number (20)
- PAT 甲级 1019. General Palindromic Number
- PAT 甲级 1019. General Palindromic Number (20)
- PAT程序设计考题——甲级1019( General Palindromic Number ) C++实现
- PAT 1019 General Palindromic Number(进制水题)
- PAT 1019 General Palindromic Number
- 浙大PAT甲级1019. General Palindromic Number (20)
- PAT甲级练习1019. General Palindromic Number (20)
- Android官方MVP架构示例项目解析
- 机器学习 -- 多元回归实现实例
- C语言执行shellcode的五种方法
- 由Tomcat 8005端口想到的...
- 安卓小案例收集一
- PAT 甲级 1019 General Palindromic Number(简单题)
- IBM MQ 发送 和 接收
- jackson学习
- Ubuntu系统的安装以及基本软件的安装
- Activity向Fragment中传值
- 支付宝H5唤醒APP
- leetcode 112 Path Sum C++
- 2016年计算机视觉和图像处理相关的国际会议一览表
- 深拷贝与浅拷贝的区别