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

Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

Discussion of Problem 1144. The Emperor's Riddle

Show all messages Hide all messages

Does this problem has a deterministic polynomial solution? If such solution exists, can anybody send it to me (ioi@list.ru) Antonina Baskova 29 Nov 2002 19:11

No, combination of deterministics and NP is one solution, but the algorithm is elementary greedy (-) Miguel Angel 1 Dec 2002 05:26

>

Re: No, combination of deterministics and NP is one solution, but the algorithm is elementary greedy (-) 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 :)