Is Possible

Problem Overview

• This problem asks whether (a, b) can reach (c, d) by repeatedly applying (a+b, b) or (a, a+b).
• Inputs: integers a, b, c, d; Output: "Yes" if reachable, else "No".
• Constraints: 1 ≤ a, b, c, d ≤ 1000.
• Domain: integer pair transformation and additive growth in algorithmic puzzles.
• A Goldman coding interview problem frequently used as an interview question.