TWC - 82 - GOOGLE KICK START - 2022 - Practice Test
Problem Statement :
You have gathered N bags of candy and you want to distribute the candy amongst M kids. The i-th bag contains Ci pieces of candy. You want to make sure that every kid gets the same amount of candy and that the number of pieces of candy they receive is the greatest possible. You can open each bag and mix all pieces of candy before distributing them to the kids.
How many pieces of candy will remain after you share the candy amongst kids, based on the rules described above?
Input
The first line of the input gives the number of test cases, T. T test cases follow.
Each test case consists of two lines. The first line of each test case contains two integers: integer N, the number of candy bags, and M, the number of kids.
The next line contains N non-negative integers C1,C2,…,CN representing array C, where the i-th integer represents the number of candies in the i-th bag.
Output
For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is the number of candies that will remain if you divide candies between kids according to the rules described above.
Limits
Time limit: 60 seconds.
Memory limit: 1 GB.
PPT :
https://docs.google.com/presentation/d/1gs0zW2xLZDhCZ7FmzFJewgY412aOhukIYdGPQ9M15BY/edit?usp=sharing
Join our TEQ Weekly Coding Group [Link: https://t.me/teqint] and share your comments. If you want any programs to be solved. Update us in that Group.
For Interview Packages :
Contact: Ismail NS, 88830 76220
T4TEQ Software Solutions is one of the top training companies in Tamilnadu, India. We have planned to put weekly interview programs.
Like the video
Comment on the video
Subscribe for more videos
Are you planning to do an online course?
Are you planning to do career development courses?
Are you stepping into college?
Here we are, T4TEQ Software solutions, Trichy
We are ready to support you...