AcWing 1496. 普通回文数
原题链接
简单
作者:
Spike_
,
2024-02-28 10:59:31
,
所有人可见
,
阅读 28
#include <iostream>
#include <vector>
using namespace std;
const int MAXN = 1e5 + 10;
vector<int> res;
int main(){
int n, b;
cin >> n >> b;
while(n != 0){
res.push_back(n % b);
n = n / b;
}
int i = 0, j = res.size() - 1;
while(i != j){
if(res[i] != res[j]){
cout << "No" << endl;
cout << res[res.size()-1];
for(int k = res.size() - 2; k >= 0; k--)
cout << ' ' << res[k];
return 0;
}
i++;
j--;
}
cout << "Yes" << endl;
cout << res[0];
for(int i = 1; i < res.size(); i++)
cout << ' ' << res[i];
return 0;
}