点击打开pat链接
#include<iostream>
#include<math.h>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<vector>
using namespace std;
#define INF 100000000
#define maxn 100010
int store[maxn];
int num,base;
int main()
{ cin>>num>>base;
if(num==0) {cout<<"Yes"<<endl;
cout<<"0";
return 0; }
int i=0;
while(num){
store[i++]=num
