ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   14 510
14
19
36670 Bipartite Permutation   10 150
6
16
36671 Bipartite Permutation (Hard)   5 46
29
31
11515 I AM VERY BUSY   132 6361
9
11
27271 Collecting Coins   1 95
9
17
34501 Divisible Strings   5 137
15
17
27039 Assembly line   16 396
16
14
348 Expedition   37 1361
18
20
35337 Faketorial Hashing   1 0
34
34
5467 Finding password   5 172
24
34
5117 Wine trading in Gergovia   49 2755
7
12
34275 Game Store   5 147
5
7
26385 Harish and his rooks puzzle   4 158
5
1
132 Help R2-D2!   11 699
21
19
26651 Hydroelectric dams   9 608
16
16
19144 Digo plays with Numbers   8 683
9
11
3944 Bee Walk   17 1284
11
15
19686 Mining Camps   2 72
26
26
18965 Milk Scheduling   11 777
11
15
34025 Palindrome Maker   3 56
17
26
34975 Prime Friendly Numbers   7 25
26
23
26649 Repair road   18 702
6
13
19320 Draw Skyline Graph   3 94
27
21
18273 Encode Integer   14 664
8
7
25309 Save Area 11   10 97
5
10
36710 To the Bird-planet   1 17
9
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