Diagonal Movement CodeChef Starters 14 Solution

Question

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

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

Input

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

Output

For each test case, print YES if it is possible to reach (x,y) from (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

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

Sample Input

6

0 2

1 2

-1 -3

-1 0

-3 1

2 -1

Sample Output

YES

NO

YES

NO

YES

NO

Explanation

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

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

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

Explanation

This question is just a cakewalk we don't need to use our brain to much here. We just need to check whether the sum of the two inputs is even or not if it is even then print yes otherwise print no. There is no logic used in this question we just observe this pattern by test cases given in the problem. So guys good luck for more contest like this, happy coding journey ahead.

Program Code in C++

#include <bits/stdc++.h>

using namespace std;

#define ll long long

ll const N = 1e6;

int main()

{

  int t;

  cin >> t;

  while (t--)

  {

    ll x,y;

    cin>>x>>y;

    ll s=x+y;

    if(s%2==0)

    cout<<"YES\n";

    else 

    cout<<"NO\n";

  }

  return 0;

}

Links

RCB and Playoffs