Hello everyone!
Today I was trying to solve ABC-51 Problem B. link to problem....
The editorial mentions a O(k^2) solution by looping through all possible values of x and y and figuring if a valid z exists for that x and y.
This solution had passed because the limits were not very tight. I was curious to know if there exists a faster way to solve this problem if the constraints are big!