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

Does this problem has a deterministic polynomial solution? If such solution exists, can anybody send it to me (ioi@list.ru)

Posted by Antonina Baskova 29 Nov 2002 19:11

No, combination of deterministics and NP is one solution, but the algorithm is elementary greedy (-)

Posted by Miguel Angel 1 Dec 2002 05:26

Re: No, combination of deterministics and NP is one solution, but the algorithm is elementary greedy (-)

Posted by Mephistos 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