Company: Walmart_12march
Difficulty: medium
Minimum Moves to Destination Problem Description Raj is a worker in a warehouse. The warehouse is laid out as a 2D coordinate plane with Raj positioned at (0,0) and his goal is to deliver a package to the coordinate (a,b). In one move Raj can cover a distance d such that 0 <= d <= z (z would be given). The first move he makes is along the x-axis and after every move, he changes his direction of move alternatively from x to y and y to x. That is, after moving along the x-axis, he will next move along the y-axis, and then back to the x-axis, and so on. Your task is to determine the minimum number of moves Raj must make to reach exactly at point (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 Raj can cover. Output Format Print the minimum number of moves Raj needs to make to reach the destination (a,b