New update is available. Click here to update.

Problem

Submissions

Solution

New

Discuss

Reach the destination

Contributed by

Arshit Babariya

Last Updated: 23 Feb, 2023

Easy

0/40

Avg time to solve 15 mins

Success Rate 85 %

34 upvotes

Problem Statement

Suggest Edit

Given a source point (sx, sy) and a destination point (dx, dy), the task is to check if it is possible to reach the destination point using the following valid moves:

(a, b) -> (a + b, b)
(a, b) -> (a, a + b)

Your task is to find if it is possible to reach the destination point using only the desired moves or not.

For example:

For the coordinates, source point = (1, 1) and destination point = (3, 5)
The output will be true as the destination point can be reached using the following sequence of moves:
(1, 1) -> (1, 2) -> (3, 2) -> (3, 5)

Detailed explanation ( Input/output format, Notes, Images )

Input Format:

The first line of input contains an integer ‘T’ representing the number of test cases. Then the test cases follow.

The only line of each test case contains four space-separated integers sx, sy, dx, and dy where sx, sy represents the coordinates of the source point and dx, dy represents the coordinates of the destination point.

Output Format:

For each test case, return the boolean true if the destination point can be reached from the source point using only the desired moves, else return false.

The output for each test case is to be printed on a separate line.

Note:

You do not need to print anything; it has already been taken care of. Just implement the given function.

Constraints:

1 <= T <= 100
1 <= x, y <= 3000

Where ‘T’ is the number of test cases and ‘x’, ‘y’ are the coordinates of the given points.

Time Limit: 1sec

Sample Input 1:

2
1 1 3 5
1 1 1 4

Sample Output 1:

True
True

Explanation For Sample Input 1:

For the first test case
The output will be true as destination point can be reached using the following sequence of moves:
(1, 1) -> (1, 2) -> (3, 2) -> (3, 5)

For the second test case
The output will be true as destination point can be reached using the following sequence of moves:
(1, 1) -> (1, 2) -> (1, 3) -> (1, 4)

Sample Input 2:

2
1 1 2 2
1 1 1 1

Sample Output 2:

False
True

Auto

Console

Recursion and Backtracking Notes

Reach the destination

Reverse Stack Using Recursion

K subsets with equal sum

Minimum distance points

Print Permutations - String

IP Address

Replace ‘O’ with ‘X’

Return Subsets Sum to K

Binary strings with no consecutive 1s

Sudoku?

Reach the destination

Problem Statement

Given a source point (sx, sy) and a destination point (dx, dy), the task is to check if it is possible to reach the destination point using the following valid moves:

Your task is to find if it is possible to reach the destination point using only the desired moves or not.

For example:

Input Format:

Output Format:

Note:

Constraints:

Sample Input 1:

Sample Output 1:

Explanation For Sample Input 1:

Sample Input 2:

Sample Output 2: