not only it does never occur but i think it is also logically wrong because if you have more a[0] than "needed" then you can just keep picking decorations from a[0], until you finish all of them. I wonder if it is possible to hack that solution given "bad |= a[0] > z;".
not only it does never occur but i think it is also logically wrong because if you have more a[0] than "needed" then you can just keep picking decorations from a[0], until you finish all of them. I wonder if it is possible to hack that solution given "bad |= a[0] > z;".