ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   16 583
14
20
36670 Bipartite Permutation   14 349
6
15
36671 Bipartite Permutation (Hard)   6 51
32
34
11515 I AM VERY BUSY   151 8243
9
11
27271 Collecting Coins   4 143
9
20
34501 Divisible Strings   5 209
15
17
27039 Assembly line   17 511
17
14
348 Expedition   57 2183
20
20
35337 Faketorial Hashing   1 10
34
34
41276 Find the missing number   0
5467 Finding password   6 182
26
34
5117 Wine trading in Gergovia   76 5282
9
12
34275 Game Store   10 200
6
7
26385 Harish and his rooks puzzle   6 202
4
1
132 Help R2-D2!   12 754
19
16
19144 Digo plays with Numbers   9 720
9
11
3944 Bee Walk   18 1420
11
15
19686 Mining Camps   3 79
30
21
18965 Milk Scheduling   15 954
10
15
34025 Palindrome Maker   5 78
12
17
34975 Prime Friendly Numbers   9 38
27
24
19320 Draw Skyline Graph   2 102
31
26
18273 Encode Integer   15 778
8
7
25309 Save Area 11   14 122
4
7
36710 To the Bird-planet   2 34
17
9

#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