ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   17 598
14
20
36670 Bipartite Permutation   14 362
6
15
36671 Bipartite Permutation (Hard)   6 52
32
34
11515 I AM VERY BUSY   151 8516
9
11
27271 Collecting Coins   4 181
9
20
34501 Divisible Strings   5 216
15
17
27039 Assembly line   17 547
17
14
348 Expedition   58 2248
20
20
35337 Faketorial Hashing   1 11
34
34
41276 Find the missing number   0
5467 Finding password   6 181
26
34
5117 Wine trading in Gergovia   76 5395
9
12
34275 Game Store   11 209
5
6
26385 Harish and his rooks puzzle   6 223
4
1
132 Help R2-D2!   12 765
19
16
19144 Digo plays with Numbers   9 724
9
11
3944 Bee Walk   19 1434
12
15
19686 Mining Camps   3 80
30
21
18965 Milk Scheduling   15 1042
10
15
34025 Palindrome Maker   5 80
12
17
34975 Prime Friendly Numbers   10 42
28
26
19320 Draw Skyline Graph   2 103
31
26
18273 Encode Integer   15 832
8
7
25309 Save Area 11   14 125
5
6
36710 To the Bird-planet   3 41
17
14

#greedy

The greedy approach - heuristic of making the locally optimal choice at each stage might be useful for this problem.

https://en.wikipedia.org/wiki/Greedy_algorithm