Problem Statement

Minimum Moves to Destination Problem Description A delivery drone starts at coordinate (0,0) on a warehouse floor mapped as a 2D plane, and it must reach the drop-off point at coordinate (a,b). Each move covers some distance d where 0 <= d <= z (z is given). The drone's very first move is along the x-axis, and it alternates axes after every move — x, then y, then x again, and so on. Work out the fewest moves the drone needs to land exactly on (a,b). Input Format First line of input contains two space separated integers 'a' and 'b' representing the x and y coordinates of the destination. Second line of input contains a single integer 'z', representing the maximum distance the drone can cover in one move. Output Format Print the minimum number of moves needed to reach the destination (a,b). Constraints 0 <= a,b <= 10 4 1 <= z <= 10 4 Examples Example 1: Input: 9 11 3 Output: 8 Explanation: Move 1: the drone travels along the x-axis from (0, 0) to (3, 0), covering d = 3,