进制转换简单题

最新推荐文章于 2022-12-13 16:40:08 发布

qq_19272233

最新推荐文章于 2022-12-13 16:40:08 发布

阅读量129

点赞数

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/qq_19272233/article/details/119305573

版权

算法专栏收录该内容

46 篇文章 0 订阅

订阅专栏

问题

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 a
i

as ∑
i=0
k

(a
i

b
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
k−i

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≤10
9
is the decimal number and 2≤b≤10
9
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

… a
0

". 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.将数先转换为十进制数y。

int y = 0,produce = 1;
while(x!=0){
	y = y + (x%10)*produce;
	x = x/10;
	produce = produce*P;
}

2.将十进制数y转换成目标进制数q,q存储在数组中。注意需要从高位往低位输出。

int z[40],num = 0;
do{
	z[num++] = y%Q;
	y = y/Q;
}while(y!=0);

代码

#include<bits/stdc++.h>
using namespace std;

long long N,b;
int z[40],num = 0;
int main(){
    cin>>N>>b;
    do{
        z[num++] = N%b;
        N = N/b;
    }while (N!=0);
    bool flag = true;
    for (int i = 0; i < num / 2; ++i) {
        if(z[i] != z[num-1-i])
            flag = false;
    }
    if(flag == true)
        cout<<"Yes"<<endl;
    else
        cout<<"No"<<endl;
    for (int j = num-1; j >= 0; --j) {
        cout<<z[j];
        if(j!=0)
            cout<<" ";
    }
    if(num==0)
        cout<<"0";
    cout<<endl;
    return 0;
}