Ashu and Arvind participated in a coding contest, as a result of which they received 𝑁N chocolates. Now they want to divide the chocolates between them equally.Can you help them by deciding if it is possible for them to divide all the 𝑁N chocolates in such a way that they each get an equal number of chocolates?You cannot break a chocolate in two or more pieces.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.The first and only line of each test case contains a single integer 𝑁N — the number of chocolates they received.Output FormatFor each test case output the answer on a new line — "Yes" (without quotes) if they can divide chocolates between them equally, and "No" (without quotes) otherwise.Each letter of the output may be printed in either uppercase or lowercase, i.e, "Yes", "YES", and "yEs" will all be treated as equivalent.Constraints1≤𝑇≤101≤T≤101≤𝑁≤101≤N≤10Sample 1:InputOutput410432YesYesNoYesExplanation:Test case 11: They can divide 1010 chocolates such that both of them get 55 chocolates each.Test case 22: They can divide 44 chocolates such that both of them get 22 chocolates each.Test case 33: There is no way to divide 33 chocolates so that they get equal number of chocolates.Test case 44: They can divide 22 chocolates such that both of them get 11 chocolate each.

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.

Two children, Lily and Ron, want to share a chocolate bar. Each of the squares has an integer on it.Lily decides to share a contiguous segment of the bar selected such that:The length of the segment matches Ron's birth month, and,The sum of the integers on the squares is equal to his birth day.Determine how many ways she can divide the chocolate.

Chocolate BarProblem Statement:Two friends, Alice and Bob, want to share a chocolate bar. Each square of the chocolate bar has a number on it.Alice wants to divide the chocolate bar into contiguous segments such that:The length of the segment matches Bob's birth month.The sum of the numbers on the squares within the segment equals Bob's birth day.Your task is to determine how many ways Alice can divide the chocolate bar according to Bob's birth day and month.Input Format:The first line contains an integer n, representing the number of squares in the chocolate bar.The second line contains n space-separated integers, representing the numbers on the chocolate squares.The third line contains two space-separated integers, d and m, representing Bob's birth day and birth month.Constraints:1 <= n <= 1001 <= number on chocolate square <= 51 <= d <= 311 <= m <= 12Output Format:The number of ways Alice can divide the chocolate bar satisfying Bob's birth day and month.Example:Consider a chocolate bar with numbers on the squares: [2, 2, 1, 3, 2]If Bob's birth day is 4 and his birth month is 2, Alice wants to find segments with a length of 2 and a sum equal to 4. In this case, two segments are meeting her criteria: [2, 2] and [1, 3].Sample Test CasesTest Case 1:Expected Output:52 2 1 3 2422Test Case 2:Expected Output:52 2 2 2 2430Test Case 3:Expected Output:12211

Dividing Mixed Numbers