ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   15 556
13
20
36670 Bipartite Permutation   11 324
5
14
36671 Bipartite Permutation (Hard)   5 51
29
31
11515 I AM VERY BUSY   149 7762
10
11
27271 Collecting Coins   3 115
11
21
34501 Divisible Strings   5 196
15
17
27039 Assembly line   17 456
17
14
348 Expedition   54 2012
20
21
35337 Faketorial Hashing   1 1
34
34
41276 Find the missing number   0
5467 Finding password   6 175
26
34
5117 Wine trading in Gergovia   72 4799
9
12
34275 Game Store   9 190
6
7
26385 Harish and his rooks puzzle   5 194
4
1
132 Help R2-D2!   12 736
20
17
19144 Digo plays with Numbers   8 704
9
11
3944 Bee Walk   18 1397
11
15
19686 Mining Camps   2 73
26
26
18965 Milk Scheduling   14 884
10
15
34025 Palindrome Maker   4 68
12
17
34975 Prime Friendly Numbers   8 33
27
24
19320 Draw Skyline Graph   2 99
31
26
18273 Encode Integer   15 711
8
7
25309 Save Area 11   12 116
5
8
36710 To the Bird-planet   2 28
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