-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmilk3.cpp
executable file
·85 lines (80 loc) · 1.88 KB
/
milk3.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
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
/*
ID: paulius10
PROG: milk3
LANG: C++
*/
#include <algorithm>
#include <fstream>
#include <iostream>
#include <set>
#include <assert.h>
using namespace std;
struct state {
int a, b, c;
bool operator<(state s) const {
if (a != s.a) return a < s.a;
if (b != s.b) return b < s.b;
return c < s.c;
}
};
void magic(int A, int B, int C, int a, int b, int c, bool possibilities[], set<state> states) {
assert(a <= A);
assert(b <= B);
assert(c <= C);
assert(a >= 0);
assert(b >= 0);
assert(c >= 0);
state s;
s.a = a;
s.b = b;
s.c = c;
if (states.find(s) != states.end()) return;
states.insert(s);
if (a == 0)
possibilities[c] = true;
// a -> b
magic(A, B, C, max(a - B + b, 0), min(b + a, B), c, possibilities, states);
// a -> c
magic(A, B, C, max(a - C + c, 0), b, min(c + a, C), possibilities, states);
// b -> a
magic(A, B, C, min(a + b, A), max(b - A + a, 0), c, possibilities, states);
// b -> c
magic(A, B, C, a, max(b - C + c, 0), min(c + b, C), possibilities, states);
// c -> a
magic(A, B, C, min(a + c, A), b, max(c - A + a, 0), possibilities, states);
// c -> b
magic(A, B, C, a, min(b + c, B), max(c - B + b, 0), possibilities, states);
}
int main() {
ifstream fin("milk3.in");
ofstream fout("milk3.out");
int A, B, C;
fin >> A >> B >> C;
fin.close();
/*states[A + 1][B + 1][C + 1];
for (int i = 0; i <= A; i++) {
for (int j = 0; j <= B; j++) {
for (int k = 0; k <= C; k++) {
states[i][j][k] = false;
}
}
}*/
bool possibilities[C + 1];
set<state> states;
for (int i = 0; i <= C; i++) possibilities[i] = false;
magic(A, B, C, 0, 0, C, possibilities, states);
bool first = true;
for (int i = 0; i <= C; i++) {
if (possibilities[i]) {
if (first) {
fout << i;
first = false;
} else {
fout << " " << i;
}
}
}
fout << endl;
fout.close();
return 0;
}