-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbj_14888.cpp
More file actions
85 lines (76 loc) · 1.92 KB
/
bj_14888.cpp
File metadata and controls
85 lines (76 loc) · 1.92 KB
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int arr[101] = {};
for(int i = 0; i < N; i++) {
cin >> arr[i];
}
string ap[4] = {"+", "-", "*", "/"};
int combi[11] = { };
int idx = 0;
for(int i = 0; i<4; i++) {
int ret;
cin >> ret;
for(int j = 0; j < ret; j++) {
combi[idx++] = i;
}
}
int pre = arr[0];
for(int i = 1; i<N; i++) {
int post = arr[i];
if(combi[i-1] == 0) {
pre += post;
} else if(combi[i-1] == 1) {
pre -= post;
} else if(combi[i-1] == 2) {
pre *= post;
} else if(combi[i-1] == 3) {
pre /= post;
}
}
int max = pre;
int min = pre;
while(next_permutation(combi, combi+(N-1))){
int pre = arr[0];
for(int i = 1; i<N; i++) {
int post = arr[i];
if(combi[i-1] == 0) {
pre += post;
} else if(combi[i-1] == 1) {
pre -= post;
} else if(combi[i-1] == 2) {
pre *= post;
} else if(combi[i-1] == 3) {
if(pre < 0) {
if(post < 0) {
pre = abs(pre) / abs(post);
} else {
pre = abs(pre) / post;
pre *= (-1);
}
} else {
if(post <0) {
pre /= abs(post);
pre *= (-1);
} else {
pre /= post;
}
}
}
}
if(pre > max) {
max = pre;
}
if(pre < min) {
min = pre;
}
cout << "\n";
}
cout << max << "\n";
cout << min << "\n";
// 0 : "+" , 1: "-" , 2: "X", 3:"/"
}