zoukankan      html  css  js  c++  java
  • PTA(Advanced Level)1019.General Palindromic Number

    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 a**i as ∑i=0k(aib**i). Here, as usual, 0≤a**i<b for all i and a**k is non-zero. Then N is palindromic if and only if a**i=a**ki 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<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 "a**k a**k−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
    
    思路
    • 题目大意:计算nb进制下的表达式,判断是否为回文数
    • (没有写关于0的特判竟然还过了…
    代码
    #include<bits/stdc++.h>
    using namespace std;
    vector<int> v;
    void get_num(int n, int b)
    {
    	int t;
    	while(n)
    	{
    		t = n % b;
    		v.push_back(t);
    		n /= b;
    	}
    }
    int main()
    {
    	int n,b;
    	cin >> n >> b;
    
    	get_num(n,b);
    	reverse(v.begin(), v.end());
    	bool same = true;
    	for(int i=0;i<v.size()/2;i++)
    		if(v[i] != v[v.size() - 1 - i])
    			same = false;
    	if(same)
    		cout << "Yes
    ";
    	else cout << "No
    ";
    	cout << v[0];
    	for(int i=1;i<v.size();i++)
    		 cout << " " << v[i];
    	return 0;
    }
    
    
    
    引用

    https://pintia.cn/problem-sets/994805342720868352/problems/994805487143337984

  • 相关阅读:
    ASP.NET AJAX入门系列(1):概述
    ASP.NET中常用的文件上传下载方法
    Asp.net中DataBinder.Eval用法的总结
    ASP.NET AJAX入门系列(6):UpdateProgress控件简单介绍
    ASP.NET AJAX入门系列(8):自定义异常处理
    Javascrip常用语句
    26个常用的方法优化 ASP.NET 的性能
    JavaScript倒计时组件
    jQuery.buildFragment源码分析
    jQuery.Callbacks源码解读
  • 原文地址:https://www.cnblogs.com/MartinLwx/p/11672168.html
Copyright © 2011-2022 走看看