1019. General Palindromic Number (20)

#include <iostream>
#include <vector>
using namespace std;
bool isPalindromic(vector<int> num){//判断数num是否是回文数
int mid=(num.size()-1)/2;
for(int i=0;i<=mid;i++){
if(num[i]!=num[num.size()-1-i])
return false;
}
return true;
}
vector<int> Ninb(int n,int b){//返回值是n的b进制数的逆置
vector<int> res;
if(n==0)
res.push_back(n);
while(n!=0){
res.push_back(n%b);
n=n/b;
}
return res;
}
int main(int argc, char const *argv[])
{
int n,b;
cin>>n>>b;
vector<int> res;
res=Ninb(n,b);
if(isPalindromic(res))
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
for(int i=res.size()-1;i>=0;i--){
if(i==0)
cout<<res[i]<<endl;
else
cout<<res[i]<<" ";
}
return 0;
}