1019. General Palindromic Number (20)
2015-12-06 10:18
393 查看
时间限制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 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:
[/code]
来自为知笔记(Wiz)
内存限制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 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:
Yes 1 1 0 1 1Sample Input 2:
121 5Sample Output 2:
No 4 4 1来源: <http://www.patest.cn/contests/pat-a-practise/1019>
#include<iostream>
#include<vector>
#include<stdio.h>
#include <algorithm>
#pragma warning(disable:4996)
using namespace std;
vector<int> num;
bool CheckSeq() {
for (int i = 0; i < num.size() / 2 + 1; i++) {
if (num[i] != num[num.size() - i - 1])
return false;
}
return true;
}
int main(void) {
int n, k;
cin >> n >> k;
int yushu;
while (true)
{
yushu = n%k;
num.push_back(yushu);
n = n / k;
if (n == 0)
break;
}
reverse(num.begin(), num.end());
if (CheckSeq() == false) {
cout << "No" << endl;
}
else
cout << "Yes" << endl;
for (int i = 0; i < num.size(); i++) {
cout << num[i];
if (i != num.size() - 1)
cout << " ";
}
return 0;
}
[/code]
来自为知笔记(Wiz)
相关文章推荐
- 1018. Public Bike Management (30)
- Linux文件系统代码学习笔记--磁盘格式化&block分配
- linux下 jdk1.8安装
- 小鑫杀怪兽
- 奇妙的23点
- train test 划分 转自 http://blog.sina.com.cn/s/blog_6a90ae320101a5rc.html
- 1017. Queueing at Bank (25)
- 1016. Phone Bills (25)
- 2015年大二上-数据结构-串(3)- 顺序串算法
- Objective-C 零散知识笔记 by STP
- python基本 面向对象
- CSS样式表中的z-index总结
- sqlite数据类型
- 图的基本存储的基本方式三
- 图的基本存储的基本方式二
- android .9.png ”点九” 图片制作方法
- 《1024伐木累》-程序员相亲都做了什么?
- 1015. Reversible Primes (20)
- 图的基本存储的基本方式一
- html 属性大全