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 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<=n<=10^9)转化成b进制数num,在求num是否是回文数。

    #include<iostream>
    #include<stdio.h>
    using namespace std;
    int main(){
    	int n,b;
    	int num[100];
    	int cnt=0;
    	int i,j;
    	scanf("%d%d",&n,&b);
    	if(n == 0){
    		cnt = 1;
    		num[0]=0;
    	}
    	for(;n>0;){
    		num[cnt]=n%b;
    		n=n/b;
    		cnt++;
    	}
    	int flag = 1;
    	for(i=0,j=cnt-1;i<j;i++,j--){
    		if(num[i]!=num[j]){
    			flag = 0;
    			break;
    		}
    	}
    	if(flag ==0){
    		printf("No
    ");
    	} 
    	else {
    		printf("Yes
    ");
    	}
    	for(i=cnt-1;i>=0;i--){
    		if(i == 0){
    			printf("%d
    ",num[i]);
    		}
    		else {
    			printf("%d ",num[i]);
    		}
    	}
    } 
    

      



  • 相关阅读:
    hdu4911 简单树状数组
    hdu4911 简单树状数组
    hdu4912 LCA+贪心
    hdu4912 LCA+贪心
    hdu4907 水dp 或者set
    hdu4907 水dp 或者set
    hdu4908 中位数子串
    hdu4908 中位数子串
    hdu4909 状态压缩(偶数字符子串)
    hdu4909 状态压缩(偶数字符子串)
  • 原文地址:https://www.cnblogs.com/grglym/p/7638225.html
Copyright © 2011-2022 走看看