ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   17 589
14
20
36670 Bipartite Permutation   14 357
6
15
36671 Bipartite Permutation (Hard)   6 52
32
34
11515 I AM VERY BUSY   151 8432
9
11
27271 Collecting Coins   4 160
9
20
34501 Divisible Strings   5 214
15
17
27039 Assembly line   17 516
17
14
348 Expedition   58 2233
20
20
35337 Faketorial Hashing   1 11
34
34
41276 Find the missing number   0
5467 Finding password   6 180
26
34
5117 Wine trading in Gergovia   76 5364
9
12
34275 Game Store   11 206
5
6
26385 Harish and his rooks puzzle   6 217
4
1
132 Help R2-D2!   12 762
19
16
19144 Digo plays with Numbers   9 723
9
11
3944 Bee Walk   18 1429
11
15
19686 Mining Camps   3 79
30
21
18965 Milk Scheduling   15 1009
10
15
34025 Palindrome Maker   5 79
12
17
34975 Prime Friendly Numbers   10 41
28
26
19320 Draw Skyline Graph   2 103
31
26
18273 Encode Integer   15 795
8
7
25309 Save Area 11   13 123
4
7
36710 To the Bird-planet   3 40
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