Help needed in CHANDF from May Long Challenge

help
1

I am trying to implement the logic that Rachit Jain’s explains in this video
But i am only passing one test case. Please help me with this code
problem link

2

Update both ans and ans_z only when temp_ans > ans
. When temp_ans == ans, update ans_z only when z1/z2 is less than ans_z. This way you will find the minimum z which gives maximum of f(x, y, z).

3

thanks @techfreak_19. I am trying it. Can you please share your solution.

4

CodeChef: Practical coding for everyone My code is mostly based on the editorial but the idea is same.

5

You can look at my AC solution on my GitHub here

1 Like