1019. General Palindromic Number (20)

点击打开链接

#include <string>
#include <string.h>
#include <cstdio>
using namespace std;
int ans[1000000];
int main(){
freopen("in.txt","r",stdin);
int n,k;
scanf("%d %d",&n,&k);
int cnt=0;
while(n!=0){
ans[cnt++]=n%k;
n/=k;
}
int flag=1;
if(cnt%2==0){
for(int i=0,j=cnt-1;i<cnt/2,j>=cnt/2;i++,j--){
if(ans[i]!=ans[j]){
flag=0;
break;
}
}
}else{
for(int i=0,j=cnt-1;i<cnt/2,j>cnt/2;i++,j--){
if(ans[i]!=ans[j]){
flag=0;
break;
}
}
}
if(flag){
printf("Yes\n");
}else{
printf("No\n");
}
for(int i=cnt-1;i>0;i--){
printf("%d ",ans[i]);
}
printf("%d\n",ans[0]);
return 0;
}