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

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 :)