【PAT】A1019. General Palindromic Number (20)

A1019. General Palindromic Number (20)

#include <cstdio>

bool isPalindromic(int a[], int len){
for(int i = 0; i <= len / 2; i++){
if(a[i] != a[len - i - 1])
return false;
}
return true;
}

int main(){
int origin, base, target[32] = {0};
scanf("%d %d", &origin, &base);

int count = 0;
// 本题注意对于0的处理，不能写成while结构，一定要用do...while【同时，任何时候进制转换，为了不忽略零，都要用do...while结构】
do{
target[count++] = origin % base;
origin /= base;
}while(origin != 0);

if(isPalindromic(target, count))
printf("Yes\n");
else
printf("No\n");

for(int i = count - 1; i >= 0; i--){
printf("%d", target[i]);
if(i > 0)
printf(" ");
}

return 0;
}