zoukankan      html  css  js  c++  java
  • 浙大pat甲级题目---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 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
    

     题目大意:就是让你判断某一十进制数字在固定进制下是否回文数

    思路:将数字转化为进制,再判断是否回文即可

    注意n=0的问题,会卡一个测试点

    #include <iostream>
    #include<vector>
    using namespace std;
    vector<int> forwards;
    vector<int> backward;
    void convert(int n,int b)
    {
        int temp;
        while (n!=0)
        {
           temp=n%b;
            n=n/b;
            backward.push_back(temp);
        }
    
    
    
    }
    int main() {
        int n,b;
        scanf("%d%d",&n,&b);
        convert(n,b);
        if(n==0)
        {
            printf("Yes
    ");
            printf("0");
        }
        else
        {
            for (int i = (int) backward.size() - 1; i >= 0; i--) {
                forwards.push_back(backward[i]);
            }
            if (backward == forwards) {
                printf("Yes
    ");
            } else {
                printf("No
    ");
            }
            for (int i = 0; i < backward.size(); i++) {
                if (i == 0) {
                    printf("%d", forwards[i]);
                } else
                    printf(" %d", forwards[i]);
            }
        }
        return 0;
    }
  • 相关阅读:
    模态框+Tab切换显示Json/Xml格式,提交Json/Xml字符串到后台
    jeDate时间插件
    ECharts柱状图+BootstrapTable联动
    ES6新增的一些常用特性
    Array数组遍历的几种方法以及Object对象的遍历
    Arguments 对象
    数组去重几种方法
    原型链图解
    切换镜像小工具
    AppID
  • 原文地址:https://www.cnblogs.com/SK1997/p/8567143.html
Copyright © 2011-2022 走看看