PAT 甲级 1019 General Palindromic Number (20 分) 进制转换问题+回文问题我的代码+别人的代码

矫情吗；* 2024-02-19 20:55 31阅读 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 ai as ∑i=0k(aibi). 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 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 "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

**鸣谢网友“CCPC拿不到牌不改名”修正数据！**

主要问题就两点：

进制转换

判断回文

但是有一个坑：不能用字符存转换后的结果，因为b的范围很大（意味着每一位的余数可能大于9，很大很大，2、4测试点卡这个），用字符只能存0~9，

我的代码：

#include<iostream>
    #include<cstdio>
    #include<cstring>
    using namespace std;
    int len=0;
    int a[50];
    void  convert(int n,int b)
    {
    	while(n!=0)
    	{
    		a[len++]=(n%b);
    		n/=b;
    	} 
    }
    int judge(int a[])
    {
    	int i=0,j;
    	int f=1;
    	j=len-1;
    	while(i<j)
    	{
    		if(a[i]!=a[j])
    		{
    			f=0;
    			break;
    		}
    		i++;
    		j--;
    	}
    	return f;
    }
    int main()
    {
    	int i,n,m,k,l;
    	
    	cin>>n>>m;
    	convert(n,m);
    	k=judge(a);
    	if(k==1)
    	{
    		printf("Yes\n");
    		l=len;
    		for(i=l-1;i>=0;i--)
    		if(i==l-1)
    		printf("%d",a[i]);
    		else
    		printf(" %d",a[i]);
    		
    	}
    	else
    	{
    		printf("No\n");
    		l=len;
    		for(i=len-1;i>=0;i--)
    		if(i==l-1)
    		printf("%d",a[i]);
    		else
    		printf(" %d",a[i]);
    	}
    	printf("\n");
    	return 0;
    }

别人的代码：

#include<cstdio>
    #include<cstring>
    #include<iostream>
    using namespace std;
    bool Judge(int z[], int num) {
        for(int i = 0; i <= num / 2; i++) {
            if(z[i] != z[num - i - 1]) {
                return false;
            }
        }
        return true;
    }
    int main() {
        int n, b, z[40], num = 0;
        scanf("%d %d", &n, &b);
        do {
            z[num++] = n % b;
            n /= b;
        }while(n != 0);
        bool flag = Judge(z, num);
        if(flag) {
            printf("Yes\n");
        } else {
            printf("No\n");
        }
        for(int i = num - 1; i >= 0; i--) {
            printf("%d", z[i]);
            if(i != 0) {
                printf(" ");
            }
        }
        return 0;
    }