PAT A1019 General Palindromic Number

妖狐艹你老母 2021-09-20 16:36 142阅读 0赞

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 (ai bi ). Here, s 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 pace.

**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 here ust 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

接下来是AC代码：

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

**解题思路:**  
1.先转换进制，使用取余法  
2.判断是否为回文数，for循环比较对称位置是否相同  
**需要注意：**  
1.小心打代码，别让键盘伤到手