Discussion @ 1144. The Emperor's Riddle @ Timus Online Judge

Miguel Angel No, combination of deterministics and NP is one solution, but the algorithm is elementary greedy (-) [1] // Problem 1144. The Emperor's Riddle 1 Dec 2002 05:26

Mephistos Re: No, combination of deterministics and NP is one solution, but the algorithm is elementary greedy (-) // Problem 1144. The Emperor's Riddle 2 Dec 2002 15:49

I can't understand how the solution can be greedy :). If we take M =
2, we'll get problem about stones and two piles, which is NP-hard.

Maybe I misunderstood the problem? And I can realize WHAT IS K :)

Discussion of Problem 1144. The Emperor's Riddle