Fading Coder

Problem Analysis The objective is to cover all occupied stalls in a linear arrangement using a maximum of M boards, minimizing the total length of the boards. If only one board is available, it must span from the leftmost occupied stall to the rightmost. Adding more boards allows leaving gaps betwee...

Recovering Secret Values from Sum Permutations Given a collection of seven integers that represent a permutation of $A, B, C, A+B, B+C, A+C,$ and $A+B+C$ (with the constraint $A \le B \le C$), the objective is to isolate the original base values. Sorting the input array in ascending order immediatel...