Pat(Advanced Level)Practice--1019(General Palindromic Number)
来源:互联网 发布:如何设置软件密码 编辑:程序博客网 时间:2024/05/17 05:03
Pat1019代码
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<cstdio>#define MAX 100using namespace std;int main(int argc,char *argv[]){int n,base;int Array[MAX];int i,j;scanf("%d %d",&n,&base);i=0;if(n==0){printf("Yes\n0\n");return 0;}while(n){Array[i]=n%base;n=n/base;i++;}i--;int flag=1;for(j=0;j<=i/2;j++){if(Array[j]!=Array[i-j]){flag=0;break;}}if(flag)printf("Yes\n");elseprintf("No\n");printf("%d",Array[i]);for(j=i-1;j>=0;j--)printf(" %d",Array[j]);printf("\n");return 0;}
- Pat(Advanced Level)Practice--1019(General Palindromic Number)
- PAT (Advanced Level) Practise 1019 General Palindromic Number (20)
- PAT(Advanced Level) 1019 - General Palindromic Number(水题)
- PAT (Advanced Level) Practise 1019 General Palindromic Number (20)
- Pat(Advanced Level)Practice--1024(Palindromic Number)
- 1019. General Palindromic Number (20) @ PAT (Advanced Level) Practise
- 【PAT Advanced Level】1019. General Palindromic Number (20)
- 【c++】PAT (Advanced Level)1019. General Palindromic Number (20)
- PAT (Advanced Level) Practise 1019. General Palindromic Number (20)
- [PAT (Advanced Level) ]1019. General Palindromic Number 解题文档
- 浙大 PAT Advanced level 1019. General Palindromic Number (20)
- 【PAT】【Advanced Level】1019. General Palindromic Number (20)
- PAT (Advanced) 1019. General Palindromic Number (20)
- PAT (Advanced Level) 1019. General Palindromic Number (20) 检测数字在给定进制下是否回文
- 1019. General Palindromic Number (20)——PAT (Advanced Level) Practise
- PAT 1019 General Palindromic Number
- 【PAT Advanced Level】1024. Palindromic Number (25)
- 【PAT】【Advanced Level】1024. Palindromic Number (25)
- zoj 3640 Help Me Escape 记忆化搜索
- 产品功能延伸 社交元素注入女性健康管理应用
- 临界段CCriticalSection的使用
- Codeforces Round #237 (Div. 2) D. Minesweeper 1D
- 狼女手工】起司猫化妆镜教程
- Pat(Advanced Level)Practice--1019(General Palindromic Number)
- 明清时期天安门四千步廊举行“秋审” 审判犯人
- 进程看门狗
- php做所有的正则验证 如:身份证 QQ等等
- 给生命一个助跑的过程(图)
- “小钢炮”陈锡联为啥受邓小平重用
- eclipse改变maven项目为web项目
- Gadget Mass Storage设备驱动程序
- cocos2d-x 跨平台开发简介