Given a point (x, y). Find whether it is possible or not to move from (0, 0) to (x, y) in exactly n steps. 4 types of steps are valid, you can move from a point (a, b) to either of (a, b+1), (a, b-1), (a-1, b), (a+1, b)
Input: x = 0, y = 0, n = 2 Output: POSSIBLE Input: x = 1, y = 1, n = 3 Output: IMPOSSIBLE
In the shortest path, one can move from (0, 0) to (x, y) in |x| + |y|. So, it is not possible to move from (0, 0) to (x, y) in less than |x| + |y| steps. After reaching one can take two more steps as (x, y) -> (x, y+1) -> (x, y).
So, it is possible if
n >= |x| + |y| and ( n-( |x| + |y| ) ) % 2 = 0.
Below is the implementation of the above approach:
- Check if a king can move a valid move or not when N nights are there in a modified chessboard
- Check if it is possible to move from (a, 0) to (b, 0) with given jumps
- Check if possible to move from given coordinate to desired coordinate
- Minimum revolutions to move center of a circle to a target
- Number of blocks in a chessboard a knight can move to in exactly k moves
- Count the total number of squares that can be visited by Bishop in one move
- Find the number of stair steps
- Maximum money that can be withdrawn in two steps
- Largest number N which can be reduced to 0 in K steps
- Number of odd and even results for every value of x in range [min, max] after performing N steps
- Generate array with minimum sum which can be deleted in P steps
- Find the minimum number of steps to reach M from N
- Number of steps to convert to prime factors
- Number of steps required to reach point (x,y) from (0,0) using zig-zag way
- Minimum steps to color the tree with given colors
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.