# Leetcode: Reaching Points

Reaching Points

Similar Problems:

A move consists of taking a point (x, y) and transforming it to either (x, x+y) or (x+y, y).

Given a starting point (sx, sy) and a target point (tx, ty), return True if and only if a sequence of moves exists to transform the point (sx, sy) to (tx, ty). Otherwise, return False.

```Examples:
Input: sx = 1, sy = 1, tx = 3, ty = 5
Output: True
Explanation:
One series of moves that transforms the starting point to the target is:
(1, 1) -> (1, 2)
(1, 2) -> (3, 2)
(3, 2) -> (3, 5)

Input: sx = 1, sy = 1, tx = 2, ty = 2
Output: False

Input: sx = 1, sy = 1, tx = 1, ty = 1
Output: True
```

Note:

sx, sy, tx, ty will all be integers in the range [1, 10^9].

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.

```## Blog link: https://code.dennyzhang.com/reaching-points
## Basic Ideas:
##   When tx > sx and ty > sy
##        we move from the target to the source by using mod functions
##
## Complexity: Time O(1), Space O(1)
class Solution:
def reachingPoints(self, sx, sy, tx, ty):
"""
:type sx: int
:type sy: int
:type tx: int
:type ty: int
:rtype: bool
"""
if tx<sx or ty<sy: return False
if tx==sx: return (ty-sy) % tx == 0
if ty==sy: return (tx-sx) % ty == 0
if ty>tx:
ty=ty%tx
else:
tx=tx%ty
return self.reachingPoints(sx, sy, tx, ty)
```

Share It, If You Like It.