1019. General Palindromic Number (20)
2015-07-09 11:33
351 查看
1019. General Palindromic Number (20)
时间限制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:
27 2
Sample Output 1:
Yes 1 1 0 1 1
Sample Input 2:
121 5
Sample Output 2:
No4 4 1
#include<vector>
#include <sstream>
#include<cmath>
#include<iomanip>
#include<iostream>
#include <ctype.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
vector<int> num;
int shang = a / b;
int yushu = a%b;
num.push_back(yushu);
while (shang!=0)
{
yushu = shang % b;
shang = shang / b;
num.push_back(yushu);
}
if (num.size() % 2 == 0)
{
cout << "No" << endl;
}
else
{
int len = num.size()/2;
int count = 0;
for (int i = 0; i < len; i++)
{
int temp = num.size()-1 - i;//注意这里是-i,并且是-1再减i。一开始这里写错了,导致耽误10分钟调试
if (num[i] == num[temp])
{
count++;
}
}
if (count == len)
{
cout << "Yes"<<endl;
}
else
{
cout << "No" << endl;
}
}
for (int i = num.size()-1; i >=0; i--)//注意输出的格式调整
{
if (i != (num.size() - 1))
cout << " " << num[i];
else
{
cout << num[i];
}
}
return 0;
}
相关文章推荐
- 使Nginx服务器支持.htaccess的方法
- Joomla!模板如何工作
- xerces-c用DOM方式操作xml
- MySQL 插入数据时,中文乱码问题的解决
- unrecognized selector sent to instance
- uva 11582 Colossal Fibonacci Numbers!
- 离线安装SDK
- 如果统计的个数相同,则按照ASII码由小到大排序输出 。如果有其他字符,则对这些字符不用进行统计。
- 托管态update更新异常——a different object with the same identifier value was already associated withthe sess
- 文章标题
- javascript设计模式的学习
- error: No resource identifier found for attribute 'format24Hour' in package 'android'
- wpf中遍历界面控件的方法
- 从输入任意个整型数,统计其中的负数个数并求所有非负数的平均值
- Linux消息队列编程示例
- Android智能指针——读书笔记
- Android 使用shape制作drawable素材
- 【CODEFORCES】 B. Design Tutorial: Learn from Life
- 百度地图SDK2.4.1 中实现路径规划
- 蒙特卡洛法(随即取样法) 数模 笔记