1019 general palindromic number (20 points)

1019 General Palindromic Number (20 branch )

The question

Give me two numbers N and b, seek N stay b Base represents the result and determines whether the result is a palindrome digit .（ The first and last numbers are the same , The second and penultimate numbers are the same …）

Ideas

Hexadecimal conversion , use N Yes b Quotient and remainder N stay b The result in base , Then judge whether the result is palindrome . Be careful 0 In all bases it is 0, It's palindrome number .

Code

#include<stdio.h>

void function(int N,int b)
{
	if(N==0){
		printf("Yes\n0");
	}else{
		int x[1000],count=0,m;
		int flag=0;
		while(N){
			x[count++]=N%b;
			N/=b;
		}
		m=count/2+1;
		for(int i=0;i<m;i++){
			if(x[i]!=x[count-1-i]){
				flag=1;
				break;
			}
		}
		if(flag){
			printf("No\n");
		}else{
			printf("Yes\n");
		}
		for(int i=count-1;i>=0;i--){
			if(i!=count-1){
				printf(" "); 
			}
			printf("%d",x[i]);
		}
	}
}

int main()
{
	int N,b;
	scanf("%d%d",&N,&b);
	function(N,b);
	return 0;
}