This is the solution to this. ### Part I
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
---|---|---|---|---|---|---|---|---|---|
D | D | B | A | D | B | B | A | D | B |
Part II
1 | 2 | 3 | 4 | 5 |
---|---|---|---|---|
AB | AD | ABD | ABD | BCD |
Part III
- Yes No No No
- 454
Part IV
- 4
- 6
- 16
- Output 1:
2 1 3 5 6 4
, output 2:3 2 5 6 1 4
Part V
There may be other equivalent solutions.
Task 1
a[x]=i
i+1
R[a[i]]
a[i]
R[i]
Task 2
a[i] * 0.95 <= b[i]
orb[i] >= a[i] * 0.95
total_a >= threshold
ortotal_a >= 50000
total_a + j + a[i]
f[j] + total_b - total_b_prefix
f[j-a[i]]