1019 General Palindromic Number
来源:互联网 发布:迪卡侬14.9背包知乎 编辑:程序博客网 时间:2024/06/18 11:05
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 2
Sample Output 1:
Yes
1 1 0 1 1
Sample Input 2:
121 5
Sample Output 2:
No
4 4 1
#include<iostream>#include<stdio.h>#include<vector>using namespace std;vector<int> getNum(int n, int d){ vector<int>vec; while (n){ vec.push_back(n%d); n /= d; } return vec;}bool isPalin(vector<int>vec){ bool flag = true; for (int i = 0; i < vec.size() / 2; i++){ if (vec[i] != vec[vec.size() - 1 - i]){ flag = false; break; } } return flag;}int main(){ for (int n; scanf("%d", &n) != EOF;){ int d; scanf("%d", &d); if (n == 0){ printf("Yes\n0\n"); continue; } vector<int>vec = getNum(n, d); if (isPalin(vec)){ printf("Yes\n"); } else{ printf("No\n"); } printf("%d", vec[vec.size() - 1]); for (int i = 1; i < vec.size(); i++){ printf(" %d", vec[vec.size() - 1 - i]); } printf("\n"); } return 0;}
- 1019 General Palindromic Number
- 1019 General Palindromic Number (20)
- PAT 1019 General Palindromic Number
- 1019 General Palindromic Number --水题
- PAT 1019 General Palindromic Number (20)
- PAT 1019 General Palindromic Number (20)
- PAT 1019 General Palindromic Number(进制水题)
- 1019. General Palindromic Number
- 1019. General Palindromic Number
- 1019. General Palindromic Number
- 1019.General Palindromic Number
- pat1019 General Palindromic Number
- 1019. General Palindromic Number
- 1019. General Palindromic Number
- General Palindromic Number
- PAT_1019. General Palindromic Number
- 1019. General Palindromic Number
- PAT_1019. General Palindromic Number
- CLayer的相关知识
- ubuntu14.04计划任务无法执行
- Android即时通讯--仿QQ即时聊天:(二)闪屏页及登录页面的实现
- android Application类的详细介绍
- 职业规划
- 1019 General Palindromic Number
- ios 9.2xcode7.2下批量打渠道包
- 关于fork()函数父子进程之间的问题
- 算法导论第三版习题6.3
- Java类文件结构(Class文件)
- CM给hive添加自定义jar包
- 毁灭程序员的15个障碍
- 【leetcode】【8】String to Integer (atoi)
- 数据分析学习