Chef is buying sweet things to prepare for Halloween!The shop sells both chocolate and candy.Each bar of chocolate has a tastiness of 𝑋X.Each piece of candy has a tastiness of 𝑌Y.One packet of chocolate contains 22 bars, while one packet of candy contains 55 pieces.Chef can only buy one packet of something sweet, and so has to make a decision: which one should he buy in order to maximize the total tastiness of his purchase?Print Chocolate if the packet of chocolate is tastier, Candy if the packet of candy is tastier, and Either if they have the same tastiness.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of one line of input, containing two space-separated integers 𝑋X and 𝑌Y — the tastiness of one bar of chocolate and one piece of candy, respectively.Output FormatFor each test case, output on a new line the answer:Chocolate if the packet of chocolate is tastier.Candy if the packet of candy is tastier.Either if they have the same tastiness.You may print each character of the output in either uppercase or lowercase, i.e, Candy, CANDY, CaNdY and cANDy will all be treated as equivalent.Constraints1≤𝑇≤1001≤T≤1001≤𝑋,𝑌≤101≤X,Y≤10Sample 1:InputOutput45 15 25 33 10ChocolateEitherCandyCandyExplanation:Test case 11: The packet of chocolate has a tastiness of 2×5=102×5=10, while the packet of candy has a tastiness of 5×1=55×1=5. The chocolate is tastier.Test case 22: The packet of chocolate has a tastiness of 2×5=102×5=10, while the packet of candy has a tastiness of 5×2=105×2=10. They have the same tastiness.Test case 33: The packet of chocolate has a tastiness of 2×5=102×5=10, while the packet of candy has a tastiness of 5×3=155×3=15. The candy is tastier.Test case 44: The packet of chocolate has a tastiness of 2×3=62×3=6, while the packet of candy has a tastiness of 5×10=505×10=50. The candy is tastier.

Choose the correct answer.A shopkeeper packed chocolates into bags of 48 and candies into bags of 150. He packed the same number of chocolates and candies. Find the least number of bags of candies the shopkeeper packed.5 bags of candies8 bags of candies3 bags of candies9 bags of candies

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.

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 people like both cadbury and amul?Choices:- 70 80 90 100

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).

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.