Hi there,
I need help in understanding the editorial of this Problem
The Editorial written in Japanese mentioned 4 methods to solve the problem which I translated using google translator and I managed to understand the first two methods. The last method mention Binary search, I am interested in a the binary search solution.
Anyone can shed some light on this would be really helpful.
Auto comment: topic has been updated by MasterMind (previous revision, new revision, compare).
Let $$$x$$$ be the deliciousness of the $$$k^{th}$$$ way. We want to binary search for $$$x$$$.
Validation takes $$$O(XYlog(Z))$$$ time. Maybe it could be done better, but I haven't thought too much about it. Once you have $$$x$$$, then finding the answer is straightforward. Is this what you were looking for?
thank you that is what i want