Calculate minimum number of such operations needed to ensure that every colleague has the same number of chocolates.

There are 𝑁 people standing in a row with some 𝑐𝑜𝑢𝑛𝑡𝑖 (1≤𝑖≤𝑁) number of chocolates in their hands. You have to select a range of people and take all their chocolates with the condition that you should be able to distribute those chocolates equally among 𝑀 boxes.Write a program to determine the maximum number of chocolates that can be placed in a box.Input formatFirst line: 𝑇 (number of test cases)First line in each test case: Two space-separated integers 𝑁 and 𝑀Second line in each test case: 𝑁 space-separated integers (denoting the number of chocolates)Output formatFor each test case, print the maximum number of chocolates that can be placed in a box.Constraints1≤𝑇≤1031≤𝑁,𝑀≤1050≤𝐶𝑜𝑢𝑛𝑡𝑖≤105Sum of 𝑁 over all test cases ≤107Sample input35 31 2 3 4 55 41 2 3 4 55 81 2 3 4 5Sample output530ExplanationIn first case, you can choose the range [1 , 5] as 1+2+3 + 4 + 5 = 20 , each box will have 5 chocolates.In second case, you can choose the range [3 , 5] as 3 + 4 + 5 = 12 , each box will have 3 chocolates.In third case, there is no way to choose any range such that 8 boxes can be filled equally.

In a village of 500 people, each person likes at least one of cadbury, nestle, amul and mars. Also 230 like cadbury, 210 like nestle, 220 like amul, 240 like mars and 40 like all four. The number of persons who like exactly one chocolate for each category is the same and is 60. The number of people who like exactly two of the four chocolates for each possible pair is 30 except for only cadbury and nestle, only nestle and amul for which it is 20 each. 10 people like all the drinks except cadbury. How many like exactly three out of the four?Choices:- 60 70 80 90

Alice and Bob are very good friends and they always distribute all the eatables equally among themselves.Alice has 𝐴A chocolates and Bob has 𝐵B chocolates. Determine whether Alice and Bob can distribute all the chocolates equally among themselves.Note that:It is not allowed to break a chocolate into more than one piece.No chocolate shall be left in the distribution.Input FormatThe first line of input will contain an integer 𝑇T — the number of test cases. The description of 𝑇T test cases follows.The first and only line of each test case contains two space-separated integers 𝐴A and 𝐵B, the number of chocolates that Alice and Bob have, respectively.Output FormatFor each test case, output on a new line YESYES if Alice and Bob can distribute all the chocolates equally, else output NONO. The output is case insensitive, i.e, yesyes, YeSYeS, yESyES will all be accepted as correct answers when Alice and Bob can distribute the chocolates equally.Constraints1≤𝑇≤10001≤T≤10001≤𝐴,𝐵≤1051≤A,B≤10 5 Sample 1:InputOutput41 11 31 21 4YESYESNONOExplanation:Test case 11: Both Alice and Bob already have equal number of chocolates, hence it is possible to distribute the chocolates equally among Alice and Bob.Test case 22: If Bob gives one of his chocolates to Alice, then both of them will have equal number of chocolates, i.e. 22. So, it is possible to distribute the chocolates equally among Alice and Bob.Test case 33: There are total 33 chocolates. These chocolates cannot be divided equally among Alice and Bob.Test case 44: Alice and Bob cannot have equal number of chocolates, no matter how they distribute the chocolates.

A certain number of chocolates which is a perfect square are distributed among 2156 students of a school equally. Find the minimum number of chocolates distributed given that it is greater than 90,000.94864984649986496864

Five chocolates of different flavours are to be distributed in three different children such that any child get at least 1 chocolate. What is the maximum number of different ways in which this can be distributed?