Repository navigation
Expand file tree
/
Copy path10344-2.cpp
More file actions
67 lines (66 loc) · 1.43 KB
/
Copy path10344-2.cpp
File metadata and controls
67 lines (66 loc) · 1.43 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
#include <bits/stdc++.h>
using namespace std;
int I;
int arr[125][5];
int a[7];
bool view[7];
vector<int> v;
void perm(void) {
int i;
if (v.size() == 5) {
for (i = 0; i < 5; i++) {
arr[I][i] = v[i];
}
I++;
}
for (i = 0; i < 5; i++) {
if (!view[i]) {
view[i] = 1;
v.push_back(a[i]);
perm();
v.pop_back();
view[i] = 0;
}
}
}
int call(int i, int rem) {
if (i == 5) {
if (rem == 23)
return 1;
else
return 0;
}
int x = 0, y = 0, z = 0;
z = call(i + 1, rem - a[i]);
x = call(i + 1, rem * a[i]);
y = call(i + 1, rem + a[i]);
x = max(x, y);
z = max(x, z);
return z;
}
int main() {
int i, j = 0, k, b[7];
memset(view, 0, sizeof(view));
I = 0;
for (i = 0; i < 7; i++) a[i] = i;
perm();
while (scanf("%d %d %d %d %d", &b[0], &b[1], &b[2], &b[3], &b[4])) {
if (b[0] == 0 && b[1] == 0 && b[2] == 0 && b[3] == 0 && b[4] == 0) return 0;
sort(b, b + 5);
for (i = 0; i < 120; i++) {
for (j = 0; j < 5; j++) {
int t = arr[i][j];
a[j] = b[t];
}
k = call(1, a[0]);
if (k == 1) {
break;
}
}
if (k == 1)
puts("Possible");
else
puts("Impossible");
}
return 0;
}