New update is available. Click here to update.

Binary Search Notes

Binary Search on Matrix

0% completed

Search in Rotated Sorted Array

Search in a 2-D Matrix

Search in a 2-D Matrix II

First and Last Position of an element in sorted array

Occurrence of x in a sorted array

Binary Search on Answer

0% completed

Allocate Books

Recycling Pens

Square root of an Integer

Aggressive Cows

Painter's Partition Problem

Mixed Problems related to Binary Search

0% completed

Chess Tournament

Ninja and Candies

Minimum time to Solve the Problems

Square Submatrix with Sum less than or equal to K

Smart Intervals

Distribute N candies among K people

Search in Infinite Sorted array of 0 and 1

Find pair Sum in rotated sorted Array

Find peak element

Find Missing Number in AP

Find Best Insertion Position in Array

Problem

Submissions

Solution

New

Discuss

Distribute N candies among K people

Contributed by

Nishant Chitkara

Last Updated: 23 Feb, 2023

Easy

0/40

Avg time to solve 15 mins

Success Rate 85 %

10 upvotes

Problem Statement

Suggest Edit

Sanyam has ‘N’ candies, he wants to distribute that into ‘K’ of his friends. He made his ‘K’ friends stand in line, in increasing order of his likeness. Not being so smart he gives 1 candy to the first friend, 2 to the second person, and so on till the kth person. In the next turn, the first person gets ‘K + 1’ candies, the second person gets ‘K + 2’ candies, and so on.

While distributing the candies, if at a turn, the number of candies to be given to a friend is less than the required candies, then that friend gets all the remaining candies and Sanyam stops the distribution.

Your task is to find the total number of candies every person has at the end.

Detailed explanation ( Input/output format, Notes, Images )

Input Format:

The first line of input contains an integer ‘T’ denoting the number of test cases.

The next ‘T’ lines represent the ‘T’ test cases.

The first and only line of each test case contains two space-separated integers ‘N’ and ‘K’ denoting the number of candies and number of friends respectively.

Output Format:

For each test case, return the total number of candies every person has at the end.

Note:

You do not need to print anything; it has already been taken care of. Just implement the given functions.

Constraints:

1 <= T <= 50
1 <= N <= 10^9
1 <= K <= 10^5

Time Limit: 1 sec

Sample Input 1:

2
7 4
4 1

Sample Output 1:

1 2 3 1
4

Explanation For Sample Input1:

Test case 1:
Sanyam has 7 candies and 4 friends.
In the first turn, the first friend gets 1 candy, the second friend gets 2 candies and the third friend gets 3 candies. Now he has used up 6 candies and 1 candy is left. As per the condition, the fourth friend has to be given 4 candies, but there is only 1 left, hence he takes one only. 

Test case 2:
As there is only one friend he will get the first candy, then the next two, and then the last one making the count 4.

Sample Input 2:

2
10 3
3 2

Sample Output 2:

5 2 3 
1 2

Auto

Console