In 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] <= 109

Mary has a bag of candies and decides to share them with her friends.Input the total number of candies Mary has, the number of candies Mary eats, and the number of friends Mary wants to share the remaining candies with. Calculate the remaining candies after Mary eats some, and use a pointer to store the result. Calculate and display how many candies each friend will receive.Input format :The first line of input consists of an integer m, representing the total number of candies Mary has.The second line consists of an integer n, representing the number of candies Mary eats.The third line consists of an integer x, representing the number of friends to share with.Output format :

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

Have the user input two integers between 1 to 20, inclusive. Create a teaParty method that takes two integer parameters that represent the quantity of tea and candy. In the teaParty method determine if the party is 1=bad, 2=good, or 3=great.A party is good (2) if both tea and candy are at least 5.if either tea or candy is at least double the amount of the other one, the party is great (3).if either tea or candy is less than 5, the party is always bad (1).Return to the main method the integer value if the party is 1=bad, 2=good, or 3=great.Method call Example: teaParty(tea, candy);Test Data:teaParty(6, 8) → 2teaParty(3, 8) → 1teaParty(20, 6) → 3

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

The first line contains an integer, , the number of students.The subsequent lines describe each student over lines.- The first line contains a student's name.- The second line contains their grade.ConstraintsThere will always be one or more students having the second lowest grade.Output FormatPrint the name(s) of any student(s) having the second lowest grade in. If there are multiple students, order their names alphabetically and print each one on a new line.