FastPrep
Problem · Math

Find the Damaged Toy

● EasyGoldman SachsOA

At a birthday party, N kids (IDs from 1 to N) sit in a circle. The host has T toys to distribute, starting from kid with ID D and giving one toy at a time in ascending order. After reaching kid N, the count continues from kid 1.

Input

Three integers:

  1. N: Number of kids
  2. T: Number of toys
  3. D: Starting kid's ID

Output

Print the ID of the kid who receives the damaged (last) toy.

Examples
01 · Example 1
N = 5
T = 2
D = 1
return = 2
:)
More Goldman Sachs problems
drafts saved locally
public int findDamagedToy(int N, int T, int D) {
    // write your code here
}
N5
T2
D1
expected2
sign in to submit