Problem Brief

Give Minimum Sum

Give the minimum sum of (x+y) such that A and B are given and (A+x) should be multiple of (B+y).

1Example 1

Input

A = 8, B = 16

Output

Explanation

Educated guess - Since A is already a multiple of B, no additional sum is needed. Therefore, the answer is 0.

2Example 2

Input

A = 7, B = 37

Output

Explanation

Educated guess - The minimum sum of (x+y) to make (A+x) a multiple of (B+y) is 4. This can be achieved by setting x = 3 and y = 1, making (A+x) = 10 and (B+y) = 38, where 10 is a multiple of 38.

Constraints

Limits and guarantees your solution can rely on.

🍊🍊

Draft autosaves locally

public int giveMinimumSum(int A, int B) {
  // write your code here
}

Input

Output