【PAT】1019. General Palindromic Number (20)
来源:互联网 发布:淘宝一次性粥杯 编辑:程序博客网 时间:2024/05/21 17:19
题目:http://pat.zju.edu.cn/contests/pat-a-practise/1019
题目描述:
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:
No
4 4 1
分析:简单题。将十进制数a转换成以b为基数的数,判断转换后的数是否是符合回文串的特点。
#include<iostream>using namespace std;#define max 100000000int result[max];long i,j;bool isPalindrome(int inStr[max]){long begin,end;for(begin=0,end=i-1; begin<=end; begin++,end--){if(result[begin] != result[end]) return false;}return true;}void change(long a, long b){i = 0;do {result[i++] = a % b;a /= b;} while (a != 0);//cout<<"i="<<i<<endl;}int main(){ long a,b;cin>>a>>b;change(a,b);if( isPalindrome(result) )cout<<"Yes"<<endl;elsecout<<"No"<<endl;//cout<<"i="<<i<<endl;for(j=i-1; j>0; j--)cout<<result[j]<<" ";cout<<result[j]<<endl;return 0;}
- 【PAT】1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)-PAT
- PAT 1019. General Palindromic Number (20)
- 浙大 PAT 1019. General Palindromic Number (20)
- PAT: 1019. General Palindromic Number (20)
- PAT A 1019.General Palindromic Number (20)
- PAT 1019. General Palindromic Number (20)
- pat 1019. General Palindromic Number (20)
- PAT 1019. General Palindromic Number (20)
- PAT 1019. General Palindromic Number (20)
- PAT 1019. General Palindromic Number (20)
- PAT甲级.1019. General Palindromic Number (20)
- PAT(A) - 1019. General Palindromic Number (20)
- 【PAT甲级】1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20) PAT 甲级
- PAT-A 1019. General Palindromic Number (20)
- PAT甲级1019. General Palindromic Number (20)
- PAT-A-1019. General Palindromic Number (20)
- 会计信息质量要求有哪些?
- poj 2195
- (笔记)C++ Primer/第五章 表达式
- C++中的类模板详细讲述
- 嵌入式ssh实现
- 【PAT】1019. General Palindromic Number (20)
- 多线程GCD的使用
- MEF学习系列(2): 导入(Import)和导出(Export)
- mcp2510驱动备份
- Android Support V7 包中 ActionBar的使用 (2) 分离式 ActionBar
- Android感应检测Sensor(简单介绍)
- Java学习之道:Java中Object... 代表什么意思
- 程序猿,该在一个公司呆多久?
- 隐藏StatusBar