zoukankan      html  css  js  c++  java
  • 1019. General Palindromic Number

    1019. General Palindromic Number (20)

    时间限制
    400 ms
    内存限制
    32000 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:
    No
    4 4 1
     1 #include <iostream>
    2 #include <fstream>
    3 #include <vector>
    4 #include <string>
    5 #include <algorithm>
    6 #include <map>
    7 #include <stack>
    8 #include <cmath>
    9 #include <queue>
    10 #include <set>
    11
    12
    13 using namespace std;
    14
    15
    16
    17
    18 int main()
    19 {
    20
    21 //ifstream cin("test.txt");
    22
    23 long N,D;
    24
    25 cin >> N >> D;
    26
    27 if( N == 0 )
    28 {
    29 cout << "Yes" << endl << "0"<< endl;
    30 return 0;
    31 }
    32
    33
    34 vector<long> str;
    35
    36 long n = N;
    37
    38 while( n != 0 )
    39 {
    40 str.push_back(n%D);
    41 n /= D;
    42 }
    43
    44 int i = 0;
    45 int j = str.size() - 1;
    46
    47 bool flag = true;
    48 while( i < j )
    49 {
    50 if( str[i] != str[j] )
    51 {
    52 flag = false;
    53 break;
    54 }
    55 ++i;
    56 --j;
    57 }
    58
    59 if( flag )
    60 {
    61 cout << "Yes" << endl;
    62 }
    63 else
    64 {
    65 cout << "No" << endl;
    66 }
    67
    68 for( int p = str.size() - 1 ; p >= 0 ; --p )
    69 {
    70 if( p != str.size() - 1 )
    71 {
    72 cout << ' ';
    73 }
    74
    75
    76 cout << str[p];
    77 }
    78
    79 cout << endl;
    80
    81
    82
    83
    84 return 0;
    85 }


  • 相关阅读:
    shell之ping减少时间间隔&ping的次数&用IP1去ping IP2的技巧
    kali界面乱码解决方案记录
    win10子系统kali-linux安装图形化界面总结
    树莓派4 64bit 编译安装QT5.13.2 和 Redis Desktop Manager 2020.1-dev
    树莓派4 (8GB) RaspiOS 64 bit 入手配置流程 2020-06-10
    阿里巴巴Java开发手册(泰山版)个人阅读精简
    Java 8 新API Steam 流 学习笔记
    IDEA中maven项目部署到云服务器上(简易)
    收藏模块的设计
    js常用代码片段(更新中)
  • 原文地址:https://www.cnblogs.com/kking/p/2331810.html
Copyright © 2011-2022 走看看