Diagonal movement Solution codechef

Diagonal movement Solution codechef

Given the coordinates (x,y)(x,y) of a point in 2-D plane. Find if it is possible to reach (x,y)(x,y) from (0,0)(0,0). The only possible moves from any coordinate (i,j)(i,j) are as follows:

  • Go to the point with coordinates (i+1,j+1)(i+1,j+1).
  • Go to the point with coordinates (i+1,j1)(i+1,j−1)
  • Go to the point with coordinates (i1,j+1)(i−1,j+1).
  • Go to the point with coordinates (i1,j1)(i−1,j−1).

Diagonal movement Solution codechef

Input Format

  • First line will contain TT, number of testcases. Then the testcases follow.
  • Each testcase contains of a single line of input, two integers x,yx,y.

Output Format Diagonal movement Solution codechef

For each test case, print YES if it is possible to reach (x,y)(x,y) from (0,0)(0,0), otherwise print NO.

You may print each character of the string in uppercase or lowercase (for example, the strings “yEs”, “yes”, “Yes” and “YES” will all be treated as identical).

Constraints

  • 1T21041≤T≤2⋅104
  • 109x,y109−109≤x,y≤109

Sample Input 1 Diagonal movement Solution codechef

6
0 2
1 2
-1 -3
-1 0
-3 1
2 -1

Sample Output 1 

YES
NO
YES
NO
YES
NO

Explanation Diagonal movement Solution codechef

Test case 11: A valid sequence of moves can be: (0,0)(1,1)(0,2)(0,0)→(1,1)→(0,2).

Test case 22: There is no possible way to reach the point (1,2)(1,2) from (0,0)(0,0).

Test case 33: A valid sequence of moves can be: (0,0)(1,1)(0,2)(1,3)(0,0)→(−1,−1)→(0,−2)→(−1,−3).

Leave a Reply

Your email address will not be published. Required fields are marked *

*