There are three friends and a total of 𝑁N candies.There will be a fight amongst the friends if all of them do not get the same number of candies.Chef wants to divide all the candies such that there is no fight. Find whether such distribution is possible.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of a single integer 𝑁N - the number of candies.Output FormatFor each test case, output YES, if we can distribute all the candies between the three friends equally. Otherwise output NO.You can output each character of the answer in uppercase or lowercase. For example, the strings yEs, yes, Yes, and YES are considered the same.Constraints1≤𝑇≤1001≤T≤1001≤𝑁≤1001≤N≤100Sample 1:InputOutput43426YESNONOYESExplanation:Test case 11: Chef can distribute all 33 candies such that each friend gets 11 candy. Since all three friends have same number of candies, there is no fight.Test case 22: There exist no way of distributing all candies such that all three friends have same number of candies.Test case 33: There exist no way of distributing all candies such that all three friends have same number of candies.Test case 44: Chef can distribute all 66 candies such that each friend gets 22 candies. Since all three friends have same number of candies, there is no fight.Did you like the problem statement?113 users found this helpful

Candy DistributionChef has 𝑁N candies. He has to distribute them to exactly 𝑀M of his friends such that each friend gets equal number of candies and each friend gets even number of candies. Determine whether it is possible to do so.NOTE: Chef will not take any candies himself and will distribute all the candies.Input FormatFirst line will contain 𝑇T, number of test cases. Then the test cases follow.Each test case contains of a single line of input, two integers 𝑁N and 𝑀M, the number of candies and the number of friends.Output FormatFor each test case, the output will consist of a single line containing Yes if Chef can distribute the candies as per the conditions and No otherwise.You may print each character of the string in uppercase or lowercase (for example, the strings yes, Yes, yEs, and YES will all be treated as identical).

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.

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.

You are given two positive integers n and limit.Return the total number of ways to distribute n candies among 3 children such that no child gets more than limit candies. Example 1:Input: n = 5, limit = 2Output: 3Explanation: There are 3 ways to distribute 5 candies such that no child gets more than 2 candies: (1, 2, 2), (2, 1, 2) and (2, 2, 1).Example 2:Input: n = 3, limit = 3Output: 10Explanation: There are 10 ways to distribute 3 candies such that no child gets more than 3 candies: (0, 0, 3), (0, 1, 2), (0, 2, 1), (0, 3, 0), (1, 0, 2), (1, 1, 1), (1, 2, 0), (2, 0, 1), (2, 1, 0) and (3, 0, 0).

Candy Distribution for StudentsIn a school, there is a row of  N students, each with their own academic rating. The teachers want to reward the students with candies, but they have specific rules:Minimum Candy Rule: Every student must receive at least one candy.Higher Rating, More Candies: Students with a higher academic rating should receive more candies than their neighbors.What is the minimum number of candies you must give?Input FormatThe first and only argument is an integer array A representing the rating of children.Output FormatReturn an integer representing the minimum candies to be given.Example InputsInput 1: A = [1, 2]Input 2: A = [1, 5, 2, 1]Example OutputsOutput 1: 3Output 2: 7Problem Constraints1 <= N <= 105-109 <= A[i] <= 109Write Your Code