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

    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:
    No
    4 4 1
    

    提交代码

     1 #include<cstdio>
     2 #include<algorithm>
     3 #include<iostream>
     4 #include<cstring>
     5 #include<queue>
     6 #include<vector>
     7 #include<cmath>
     8 using namespace std;
     9 int main(){
    10     //freopen("D:\INPUT.txt","r",stdin);
    11     int n,b;
    12     scanf("%d %d",&n,&b);    
    13     vector<int> v;
    14     v.push_back(n%b);//注意n==0的情况!!
    15     n/=b;
    16     while(n){
    17         v.push_back(n%b);
    18         n=n/b;
    19     }
    20     int i;
    21     for(i=0;i<v.size()/2;i++){
    22         if(v[i]!=v[v.size()-1-i]){
    23             break;
    24         }
    25     }
    26     if(i==v.size()/2){
    27         printf("Yes");
    28     }
    29     else{
    30         printf("No");
    31     }
    32     printf("
    ");
    33     printf("%d",v[v.size()-1]);
    34     for(i=v.size()-2;i>=0;i--){
    35         printf(" %d",v[i]);
    36     }
    37     printf("
    ");
    38     return 0;
    39 }
  • 相关阅读:
    idea如何使用git关联远程仓库
    项目首次上传至git仓库步骤
    Eclipse 的 Java Web 项目环境搭建
    Postman
    Postman接口测试之POST、GET请求方法
    接口测试3A原则
    使用unittest和ddt进行数据驱动
    每天进步一点点006
    每天进步一点点005
    Selenium2+python自动化1-环境搭建(悠悠课程之路)
  • 原文地址:https://www.cnblogs.com/Deribs4/p/4761314.html
Copyright © 2011-2022 走看看