PAT 1019

#include<cstdio>#include<algorithm>#include<stdlib.h>#include<cstring>bool Judge(int b[],int num){	for(int i=0;i<=(num-1)/2;i++)	{		if(b[i]!=b[num-1-i])			return false;	}	return true;}int main(){	int n,b,z[40]={};//一个整型转换为二进制数最多33位	int num=0;	scanf("%d%d",&n,&b);	do	{		z[num++]=n%b;		n=n/b;	}while(n!=0);	bool flag=Judge(z,num);	if(flag)	{		PRintf("Yes/n");		for(int i=num-1;i>0;i--)		{			printf("%d ",z[i]);		}		printf("%d",z[0]);	}	else	{		printf("No/n");		for(int i=num-1;i>0;i--)		{			printf("%d ",z[i]);		}		printf("%d",z[0]);	}	system("pause");	return 0;}