Candy Rounds

Difficulty: 1100 3000 ms 128 MB

implementation

N children sit in a circle; child i asks for i candies each time it is their turn (turns go 1, 2, ..., N, 1, 2, ...). You start with C candies and serve children in order until you cannot fully serve the next child. Print how many servings you made and how many candies remain.

Input: one line with two integers N and C.

Output: two integers: the number of full servings, and the leftover candies.

Constraints:

• 1 ≤ N ≤ 1000
• 0 ≤ C ≤ 10⁹

Sample Tests

3 15

8 0

2 3

2 0

Read the Editorial