zoukankan      html  css  js  c++  java
  • 1019 General Palindromic Number (20)

    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 a~i~ as the sum of (a~i~b^i^) for i from 0 to k. Here, as usual, 0 <= a~i~ < b for all i and a~k~ is non-zero. Then N is palindromic if and only if a~i~ = a~k-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 <= 10^9^ is the decimal number and 2 <= b <= 10^9^ 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 "a~k~ a~k-1~ ... a~0~". 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

    题目大意:给一个十进制数a和一个进制b,把十进制数转换b进制的数判断a在b进制是否是一个回文数
    注意点:因为在进制转换的时候,判断条件是while(a),当a=0时无法进入循环,需要单独处理
     1 #include<iostream>
     2 #include<vector>
     3 using namespace std;
     4 int main(){
     5   int a, b, c=0, d;
     6   vector<int> v;
     7   cin>>a>>b;
     8   d = a;
     9   if(a==0) v.push_back(0);
    10   while(a){
    11     v.push_back(a%b);
    12     c = c*b+(a%b);
    13     a /= b;
    14   }
    15   if(c==d) cout<<"Yes"<<endl;
    16   else cout<<"No"<<endl;
    17   cout<<v[v.size()-1];
    18   for(int i=v.size()-2; i>=0; i--) cout<<" "<<v[i];
    19   
    20   return 0;
    21 }
    有疑惑或者更好的解决方法的朋友,可以联系我,大家一起探讨。qq:1546431565
  • 相关阅读:
    GNSS学习笔记-观测量模型和定位定速方程
    矩阵学习-基本矩阵分类
    矩阵学习-QR分解和最小二乘问题求解
    ARM 处理器 MIPS/DMIPS/MFLOPS 理解
    GNSS学习笔记-信号频率分配表
    左移右移为负数的情况
    GNSS学习笔记-坐标转换
    GCC预编译宏查看
    Windows Store无法联网时安装WSL
    Virtual box中Ubuntu虚拟机磁盘碎片整理和空间清理方法
  • 原文地址:https://www.cnblogs.com/mr-stn/p/9153298.html
Copyright © 2011-2022 走看看