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 ie 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 (denoting the steps in which he has to reach).

**Input**

First line of input contains of an integer 'T' denoting number of test cases Then T test cases follow .

Each test case contains three integers a,b and x .

**Output**

for each case print 1 if robot can reach the destination (a,b) in exactly x steps, print 0 if he can't.

**Note :** No matter where the robot is in between he must be present at final destination at xth step.

**Constraints**:

1<=t<=50

10^(-9)<=a,b<=10^9

1<=x<=2*10^9

**Example**:

**Input**:

2

5 5 11

10 15 25

**Output**:

0

1

Author: hardikgulati96

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

Vagesh Verma | 98 |

UrGuru | 98 |

chaolinyu | 84 |

prernaus24 | 83 |

devendrachoudhary5485 | 74 |

abducodes | 624 |

harshtyagi36 | 298 |

highway_to_hell | 252 |

rajeswarii | 248 |

arpit_anshuman | 240 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4567 |

Login to report an issue on this page.