PAT刷题:1019. General Palindromic Number (20)
来源:互联网 发布:mac os 配置 postman 编辑:程序博客网 时间:2024/06/03 14:42
本题比较简单
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 <iostream>#include <cstdio>#include <cstdlib>#include <cmath>#include <algorithm>#include <functional>#include <numeric>#include <vector>#include <list>#include <map>#include <string>#include <queue>using namespace std;string num2str(long long int _n){ string temp; do{ temp=(char)(_n%10+'0')+temp; _n=_n/10; }while(_n!=0); return temp;}int main(){ long long int n,b; cin>>n>>b; vector<string> output , r_output; do{ output.insert(output.begin() , num2str(n%b)); n=n/b; }while(n!=0); r_output=output; reverse(r_output.begin() , r_output.end()); if(output == r_output)cout<<"Yes"<<endl; else cout<<"No"<<endl; for(int i=0;i<output.size();i++){ cout<<*(output.begin() + i); if(i< (output.size()-1) )cout<<" "; } return 0;}
- PAT刷题:1019. General Palindromic Number (20)
- 【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)
- 从Wikidata上面获取数据及关系的几种方法
- 简单的angular实现一个购物车小功能
- 浅谈HTTP中Get、Post、Put与Delete的区别
- hdu 1561
- js把html中的table数据导出到Excel中
- PAT刷题:1019. General Palindromic Number (20)
- 【bzoj1821】[JSOI2010]Group 部落划分
- mybatis分页多条件查询指定时间段数据的sql语句
- XRecyclerView多条目加载
- 发现了以元素 'd:skin' 开头的无效内容。此处不应含有子元素
- Linux suspend 流程介绍(2)之 freeze task
- 我的第一个博客
- 从“云计算”走向“雾计算”
- 打破合资限制?特斯拉可能在上海独资建厂