1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40
41. 41
42. 42
43. 43
44. 44
45. 45
46. 46
47. 47
48. 48
49. 49
50. 50
51. 51
52. 52
53. 53
54. 54
55. 55
56. 56
57. 57
58. 58
59. 59
60. 60
61. 61
62. 62
63. 63
64. 64
65. 65
66. 66
67. 67
68. 68
69. 69
70. 70
71. 71
72. 72
73. 73
74. 74
75. 75
76. 76
77. 77
78. 78
79. 79
80. 80
81. 81
82. 82
83. 83
84. 84
85. 85
86. 86
87. 87
88. 88
89. 89
90. 90
91. 91
92. 92
93. 93
94. 94
95. 95
96. 96
97. 97
98. 98
99. 99
100. 100
101. 101
102. 102
103. 103
104. 104
105. 105
106. 106
107. 107
108. 108
109. 109
110. 110
111. 111
112. 112
113. 113
114. 114
115. 115
116. 116
117. 117
118. 118
119. 119
120. 120
121. 121
122. 122
123. 123
124. 124
125. 125
126. 126
127. 127
128. 128
129. 129
130. 130
131. 131
132. 132
133. 133
134. 134
135. 135
136. 136
137. 137
138. 138
139. 139
140. 140
141. 141
142. 142
143. 143
144. 144
145. 145
146. 146
147. 147
148. 148
149. 149
150. 150
151. 151
152. 152
153. 153
154. 154
155. 155
156. 156
157. 157
158. 158
159. 159
160. 160
161. 161

#include <iostream>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;

// DP Gimkit Solver
// Developed by SAMCHOOO

// Initial conditions
ll start = 0, goal = 1e10;
int it = 150;

// State: Iteration, Upgrade status, Power-up status
ll DP[200][1000][36];

// Upgrade values and costs
double val[3][10] = {
    { 1, 5, 50, 100, 500, 2000, 5000, 10000, 250000, 1000000 },
    { 2, 20, 100, 200, 1000, 4000, 10000, 50000, 1000000, 5000000 },
    { 1, 1.5, 2, 3, 5, 8, 12, 18, 30, 100 }
};
ll cost[2][3][10] = {
    { { 0, 10, 100, 1000, 10000, 75000, 300000, 1000000, 10000000, 100000000},
    { 0, 15, 150, 1500, 15000, 115000, 450000, 1500000, 15000000, 200000000 },
    { 0, 50, 300, 2000, 12000, 85000, 700000, 6500000, 65000000, 1000000000 } },
    { { 0, 8, 75, 750, 7500, 56250, 225000, 750000, 7500000, 75000000 },
    { 0, 12, 113, 1125, 11250, 86250, 337500, 1125000, 11250000, 150000000 },
    { 0, 38, 225, 1500, 9000, 63750, 525000, 4875000, 48750000, 750000000 } }
};

// Power-up costs
int pcost[4] = { 20, 50, 250, 1000 };
double pcentcost[4] = { 0.03, 0.06, 0.16, 0.30 };
ll calc_pcost(int i, ll money) { return 5 * ceil((double)(pcentcost[i] * money + pcost[i]) / 5); }

int main() {
    memset(DP, -1, sizeof(DP));
    DP[0][0][0] = 0;
    for (int i = 0; i < it; i++) {
        for (int j = 0; j < 1000; j++) {
            int MPQ = j / 100, SB = (j / 10) % 10, M = j % 10;
            for (int k = 0; k < 36; k++) {
                if (DP[i][j][k] != -1) {
                    int D = (j / 18) % 2, R = (j / 9) % 2, B1 = (j / 3) % 3, B2 = j % 3;
                    ll money = DP[i][j][k], inc = round((val[0][MPQ] + val[1][SB]) * val[2][M]);
                    
                    // Answer a question
                    if (money + inc > DP[i + 1][j][k]) {
                        DP[i + 1][j][k] = money + inc;
                        // pre[v] = u;
                    }
                    
                    // Answer a question using the mini bonus
                    if (B1 == 1 && 2 * money + inc > DP[i + 1][j][k + 3]) {
                        DP[i + 1][j][k + 3] = 2 * money + inc;
                        // pre[v] = u;
                    }
                    
                    // Answer a question using the mega bonus
                    if (B2 == 1 && 5 * money + inc > DP[i + 1][j][k + 1]) {
                        DP[i + 1][j][k + 1] = 5 * money + inc;
                        // pre[v] = u;
                    }
                    
                    // Answer a question using both the mini bonus and the mega bonus
                    if (B1 == 1 && B2 == 1 && 10 * money + inc > DP[i + 1][j][k + 4]) {
                        DP[i + 1][j][k + 4] = 10 * money + inc;
                        // pre[v] = u;
                    }
                    
                    // Upgrade money per question
                    if (MPQ < 9 && money - cost[D][0][MPQ + 1] > DP[i][j + 100][k]) {
                        DP[i][j + 100][k] = money - cost[D][0][MPQ + 1];
                        // pre[v] = u;
                    }
                    
                    // Upgrade streak bonus
                    if (SB < 9 && money - cost[D][1][SB + 1] > DP[i][j + 10][k]) {
                        DP[i][j + 10][k] = money - cost[D][1][SB + 1];
                        // pre[v] = u;
                    }
                    
                    // Upgrade multiplier
                    if (M < 9 && money - cost[D][2][M + 1] > DP[i][j + 1][k]) {
                        DP[i][j + 1][k] = money - cost[D][2][M + 1];
                        // pre[v] = u;
                    }
                    
                    // Buy the discounter
                    if (D == 0 && money - calc_pcost(2, money) > DP[i][j][k + 18]) {
                        DP[i][j][k + 18] = money - calc_pcost(2, money);
                        // pre[v] = u;
                    }
                    
                    // Buy the rebooter
                    if (R == 0 && money - calc_pcost(3, money) > DP[i][j][9]) {
                        DP[i][j][9] = money - calc_pcost(3, money);
                        // pre[v] = u;
                    }
                    
                    // Buy the mini bonus
                    if (B1 == 0 && money - calc_pcost(0, money) > DP[i][j][k + 2]) {
                        DP[i][j][k + 2] = money - calc_pcost(0, money);
                        // pre[v] = u;
                    }
                    
                    // Buy the mega bonus
                    if (B2 == 0 && money - calc_pcost(1, money) > DP[i][j][k + 1]) {
                        DP[i][j][k + 1] = money - calc_pcost(1, money);
                        // pre[v] = u;
                    }
                }
            }
        }
    }
    
    // Find and print solution
    for (int i = 0; i < it; i++) {
        for (int j = 0; j < 1000; j++) {
            // int MPQ = j / 100, SB = (j / 10) % 10, M = j % 10;
            for (int k = 0; k < 36; k++) {
                // int D = (k / 18) % 2, R = (k / 9) % 2, B1 = (k / 3) % 3, B2 = k % 3;
                if (DP[i][j][k] > goal) {
                    cout << i << " " << j << " " << k << endl;
                    
                    /*for (state p = u; !(p == s); p = pre[p]) {
                        cout << p.MPQ << " " << p.SB << " " << p.M << " " << p.D << " " << p.R << " " << p.B1 << " " << p.B2 << endl;
                    }*/
                    return 0;
                }
            }
        }
    }
    
    /*vector<int> output;
    for (int i = 999; i != 0; i = pre[i]) output.push_back(i);
    output.push_back(0);
    reverse(output.begin(), output.end());
    
    for (int i = 1; i < output.size(); i++) {
        if (output[i] / 100 != output[i - 1] / 100) {
            cout << left << setw(25) << ("Upgrade MPQ to L" + format_int(output[i] / 100 + 1));
            cout << left << setw(25) << (" Cost: " + format_int(cost[output[i] / 100][0]));
            // cout << left << setw(25) << (" Remainder: " + format_int(rem[output[i]]));
        }
        else if ((output[i] / 10) % 10 != (output[i - 1] / 10) % 10) {
            cout << left << setw(25) << ("Upgrade SB to L" + format_int((output[i] / 10) % 10 + 1));
            cout << left << setw(25) << (" Cost: " + format_int(cost[(output[i] / 10) % 10][1]));
            // cout << left << setw(25) << (" Remainder: " + format_int(rem[output[i]]));
        }
        else {
            cout << left << setw(25) << ("Upgrade M to L" + format_int(output[i] % 10 + 1));
            cout << left << setw(25) << (" Cost: " + format_int(cost[output[i] % 10][2]));
            // cout << left << setw(25) << (" Remainder: " + format_int(rem[output[i]]));
        }
        cout << " Number of questions: " << DP[output[i]] - DP[output[i - 1]] << endl;    
    }
    cout << "Total questions: " << DP[999] + 2 << endl;*/
}