L2 learnings

  AIRLINE RESTRICTIONS Problem Code:   AIRLINE Chef has 3 bags that she wants to take on a flight. They weigh A , B , and C kgs respectively. She wants to check-in exactly two of these bags and carry the remaining one bag with her. The airline restrictions says that the total sum of the weights of the bags that are checked-in cannot exceed D kgs and the weight of the bag which is carried cannot exceed E kgs. Find if Chef can take all the three bags on the flight. Input Format The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. Each testcase contains a single line of input, five space separated integers A,B,C,D,E . Output Format For each testcase, output in a single line answer  "YES"  if Chef can take all the three bags with her or  "NO"  if she cannot. You may print each character of the string in uppercase or lowercase (for example, the strings "yEs", "yes", ...

HELPING CHEF Problem Code:  FLOW008   Write a program, which takes an integer   N   and if the number is less than 10 then display "Thanks for helping Chef!" otherwise print "-1". Input The first line contains an integer  T , total number of testcases. Then follow  T  lines, each line contains an integer  N . Output For each test case, output the given string or -1 depending on conditions, in a new line. Constraints 1  ≤   T   ≤  1000 -20  ≤   N   ≤  20 Example Input 3 1 12 -5 Output Thanks for helping Chef! -1 Thanks for helping Chef! . . . Solution in C. #include <stdio.h> #include <stdlib.h> int main() { int t ; scanf ( "%d" ,&t ) ; while (t--) { int a; scanf ( "%d" ,&a ) ; if(a<10){               printf("Thanks for helping chef!\n");          }    ...

PACKAGING CUPCAKES Problem Code:  MUFFINS3 Now that Chef has finished baking and frosting his cupcakes, it's time to package them. Chef has  N  cupcakes, and needs to decide how many cupcakes to place in each package. Each package must contain the same number of cupcakes. Chef will choose an integer  A  between 1 and  N , inclusive, and place exactly  A  cupcakes into each package. Chef makes as many packages as possible. Chef then gets to eat the remaining cupcakes. Chef enjoys eating cupcakes very much. Help Chef choose the package size  A  that will let him eat as many cupcakes as possible. Input Input begins with an integer  T , the number of test cases. Each test case consists of a single integer  N , the number of cupcakes. Output For each test case, output the package size that will maximize the number of leftover cupcakes. If multiple package sizes will result in the same number of leftover cupcakes, print the largest s...

BREAKING THE RECORDS   Maria plays college basketball and wants to go pro. Each season she maintains a record of her play. She tabulates the number of times she breaks her season record for   most points   and   least points   in a game. Points scored in the first game establish her record for the season, and she begins counting from there. Example Scores are in the same order as the games played. She tabulates her results as follows: Count Game Score Minimum Maximum Min Max 0 12 12 12 0 0 1 24 12 24 0 1 2 10 10 24 1 1 3 24 10 24 1 1 Given the scores for a season, determine the number of times Maria breaks her records for  most  and  least  points scored during the season. Function Description Complete the  breakingRecords  function in the editor below. breakingRecords has the ...