1019. General Palindromic Number (20)
来源:互联网 发布:centos 桥接网络 编辑:程序博客网 时间:2024/06/04 18:29
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
函数引用vector地址,如果不加&符号,vector在别的函数中无法使用。
//// main.cpp// PalindromicNumber//// Created by Hui Du on 2017/10/5.// Copyright © 2017年 Hui Du. All rights reserved.//#include <iostream>#include <string.h>#include <cstdio>#include <vector>using namespace std;void getPalinNum(vector<int>& num, int n, int b){ do{ num.push_back(n%b); n = n/b; }while(n != 0);}int isPalinNum(vector<int>& num){ int i; int size = (int)num.size(); for(i = 0; i < size; i++){ if (num[i] != num[size-1 - i]) { return 0; } } return 1;}void printPalinNum(vector<int>& num){ int i; int size = (int)num.size(); for(i = size -1; i >=0 ; i--){ if (i != 0) { printf("%d ", num[i]); } else printf("%d", num[i]); }}int main(int argc, const char * argv[]) { // insert code here... int N, base; vector<int> num; cin >> N >> base; getPalinNum(num, N, base); if(isPalinNum(num)){ cout << "Yes\n"; }else cout << "No\n"; printPalinNum(num); //cout << "\n"; return 0;}
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 1019. General Palindromic Number (20)
- 41. First Missing Positive(第一个缺失的正数)
- 超级详细---ESP3266(3)
- 阿克曼(Ackmann)函数
- HTML CSS 清除浮动
- Chapter5 语句
- 1019. General Palindromic Number (20)
- 关于Java初级程序员成长中要读的几本书
- Git 命令小结
- numpy 切片操作
- 实验二 线性表综合实验(单链表)
- C++常用小知识点总结
- java List 排序 Collections.sort() 对 List 排序
- ACM算法:迪杰斯特拉最短路径
- leetcode Product of Array Except Self 生成除自己之外的数组