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 b2, where it is written in standard notation with k+1 digits ai​​ as (. Here, as usual, 0 for all i and ak​​ is non-zero. Then N is palindromic if and only if ai​​=aki​​ for all i. Zero is written 0 in any base and is also palindromic by definition.

    Given any positive 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 positive numbers N and b, where 0 is the decimal number and 2 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​​ ak1​​ ... 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
    #include<iostream>
    using namespace std;
    
    int main()
    {
        int arr[30],brr[30];
        long long a,b;//先输入a , b 数字和要转的进制
        cin>>a>>b;
        int i=0;
        while(a>0)//转为b进制
        {
            arr[i++] = a % b;
            a = a/b;
        }
        
        int flag = 1;//flag=1 表示结果是回文数
        
        for(int j = 0;j<i/2;j++)
        {
            if(arr[j]!=arr[i-j-1])
            {
                flag = 0 ;//不是回文数
                break; 
            }
            
        }
        
        if(flag==1)
            printf("Yes
    ");
        else
        
            printf("No
    ");
      if(i==0)//如果输入的是0
      {
        printf("0");
       return 0; 
      }
        i--;//i表示转换后一共有i位
        while(i)
        {
            if(i!=0)
                cout<<arr[i--]<<" ";
            if(i==0)
                cout<<arr[0];
        }
        
      
        
        
        return 0;
    }
     
  • 相关阅读:
    【Linux&amp;Unix--open/close/write/read系统调用】
    瑞丽的SQL-SQL Server的表旋转(行列转换)
    oracle查询和编写数据字典
    [Python]How to handle the exception in Python?
    【Android 应用开发】 FastJson 使用具体解释
    OpenStack Dashboard
    Java Drp项目实战——Drp知多少
    腾讯下一个重点:硬件;硬件自身的未来也正进入多元化发展
    一个简单的带缓存http代理
    Swift语言教程中文文档
  • 原文地址:https://www.cnblogs.com/qinmin/p/12853461.html
Copyright © 2011-2022 走看看