-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1019.cpp
43 lines (41 loc) · 793 Bytes
/
1019.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
//
// 1019.cpp
// 算法
//
// Created by 王怡凡 on 2017/8/19.
// Copyright © 2017年 王怡凡. All rights reserved.
//
#include <stdio.h>
#include<vector>
using namespace std;
int n,b;
int main() {
scanf("%d%d",&n,&b);
int num;
vector<int> result;
do {
num = n%b;
result.push_back(num);
n /= b;
} while(n!=0);
int length = int(result.size());
bool flag = true;
for(int i=length-1;i>=0;i--) {
if(result[i]!=result[length-1-i]) {
flag = false;
break;
}
}
if(!flag) {
printf("No\n");
} else {
printf("Yes\n");
}
for(int i=length-1;i>=0;i--) {
printf("%d",result[i]);
if(i!=0) {
printf(" ");
}
}
return 0;
}