[Solved] Diagonal movement codechef solution – 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) 

Diagonal movement codechef solution

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 codechef solution

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

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).

Diagonal movement codechef solution

Constraints

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

Sample Input 1 

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

Sample Output 1 

YES
NO
YES
NO
YES
NO

Diagonal movement codechef solution

Explanation

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).


  1. Airline Restrictions codechef solution
  2. Travel Pass codechef solution
  3. Shuffling Parities codechef solution
  4. XOR Equal codechef solution
  5. 2-D Point Meeting codechef solution
  6. Minimize Digit Sum codechef solution
  7. Treasure Hunt codechef solution

Diagonal movement codechef solution

Leave a Comment