Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

Consider a 2d plane and a Robot which is located at (0,0) who can move only one unit step at a time in any direction i.e. if its initial position is (x,y), he can go to positions (x + 1, y), (x - 1, y), (x, y + 1) or (x, y - 1). Now Given three integers a,b (denoting the final position where the robot has to reach), and x. Find out if the Robot can reach the final position in exactly x steps.

**Example 1:**

Input:a =5,b =5,x=11Output:0Explanation:No matter how the Robot moves, the Robot won't be able to reach point (5,5) in exactly 11 moves.

**Example 2:**

Input:a =10,b =15,x=25Output:1Explanation:The Robot can move 10 times towards positive x-axis and then 15 times towards positive y-axis to reach (10,15).

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **canReach()** which takes 3 Integers a,b and x as input and returns the answer.

**Expected Time Complexity:** O(1)

**Expected Auxiliary Space:** O(1)

**Constraints:**

-10^{9} <= a,b <= 10^{9}

1 <= x <= 2*10^{9}

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Final Destination

...