EASY_ZJU_PAT_1019_General Palindromic Number_数值转换
来源:互联网 发布:淘宝网上的主板交换 编辑:程序博客网 时间:2024/05/17 05:09
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<vector>
using namespace std;
vector<int> changeRadix(int num,int radix){
vector<int> newNum;
if(num == 0){
newNum.push_back(0);
}else{
while(num>0){
int a = num%radix;
num /= radix;
newNum.push_back(a);
}
}
return newNum;
}
bool isPalic(vector<int> numbers){
bool palic = true;
int length = numbers.size();
if(numbers.size()/2 != 0){
length += 1;
}
for(int i = 0; i<length/2;i++){
if(numbers[i] == numbers[numbers.size() - 1 - i]){
continue;
}else{
palic = false;
break;
}
}
return palic;
}
int main(){
int num,r;
cin>>num>>r;
vector<int> numbers = changeRadix(num,r);
if(isPalic(numbers)){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
for(int numI = numbers.size()-1; numI >= 0; numI--){
if(numI != 0){
cout<<numbers[numI]<<" ";
}else{
cout<<numbers[numI];
}
}
return 0;
}
- EASY_ZJU_PAT_1019_General Palindromic Number_数值转换
- 1019. General Palindromic Number_回文数
- 数值转换
- 数值转换
- 数值转换
- 数值转换
- 数值转换
- 数值转换
- 数值转换
- 数值转换
- 数值转换
- 字符串转换数值 ,数值转换字符串
- php数值转换时间 时间转换数值
- 数值转换为十六进制
- 字符串转换为数值
- 数值转换(Convert/Int32)
- Perl数值转换
- 趣味数值转换
- 自动拷贝文件
- java实现冒泡、选择、快速排序算法
- java的接口技术
- 中山企业高薪招工也不易 月薪5000应聘不到叁成
- POCO线程池
- EASY_ZJU_PAT_1019_General Palindromic Number_数值转换
- win7无线热点
- 判断浏览器的版本
- PHPCMS v9 在windows2008系统 IIS7 下设置伪静态的方法
- js判断文件格式与大小
- 基于脚本实现动
- 《java解惑》读书笔记7——库谜题
- [ACM] hdu 1022 Train Problem I(栈的使用)
- 数据保护API