Skip to main content

Chef and IPC Certificates codechef November cook off challenge solution

 Chef and IPC Certificates  codechef November cook off challenge solution-

Problem statement-

There were N students (numbered 1 through N) participating in the Indian Programming Camp (IPC) and they watched a total of K lectures (numbered 1 through K). For each student i and each lecture j, the i-th student watched the j-th lecture for Ti,j minutes.

Additionally, for each student i, we know that this student asked the question, "What is the criteria for getting a certificate?" Qi times.

The criteria for getting a certificate is that a student must have watched at least M minutes of lectures in total and they must have asked the question no more than 10 times.

Find out how many participants are eligible for a certificate.


  • The first line of the input contains three space-separated integers NM and K.
  • N lines follow. For each valid i, the i-th of these lines contains K+1 space-separated integers Ti,1,Ti,2,,Ti,K,Qi.


Print a single line containing one integer — the number of participants eligible for a certificate.


  • 1N,K1,000
  • 1M106
  • 1Qi106 for each valid i
  • 1Ti,j1,000 for each valid i and j

Example Input

4 8 4
1 2 1 2 5
3 5 1 3 4
1 2 4 5 11
1 1 1 3 12

Example Output



  • Participant 1 watched 1+2+1+2=6 minutes of lectures and asked the question 5 times. Since 6<M, this participant does not receive a certificate.
  • Participant 2 watched 3+5+1+3=12 minutes of lectures and asked the question 4 times. Since 12M and 410, this participant receives a certificate.
  • Participant 3 watched 1+2+4+5=12 minutes of lectures and asked the question 11 times. Since 12M but 11>10, this participant does not receive a certificate.
  • Participant 4 watched 1+1+1+3=6 minutes of lectures and asked the question 12 times. Since 6<M and 12>10, this participant does not receive a certificate.

Only participant 2 receives a certificate.

link -

Must Join My telegram channel for more editorial post-

Solution -

this problem can be solved by using brute force approach .

Follow my code -


Popular posts from this blog

Vaccine Distribution Codechef December Long challenge solution 2020

 Vaccine Distribution  Codechef December Long challenge solution 2020- This Problem vaccine distribution is taken from December long challenge 2020. lets read problem statement. Problem statement- Finally, a COVID vaccine is out on the market and the Chefland government has asked you to form a plan to distribute it to the public as soon as possible. There are a total of  N N  people with ages  a 1 , a 2 , … , a N a 1 , a 2 , … , a N . There is only one hospital where vaccination is done and it is only possible to vaccinate up to  D D  people per day. Anyone whose age is  ≥ 80 ≥ 80  or  ≤ 9 ≤ 9  is considered to be  at risk . On each day, you may not vaccinate both a person who is at risk and a person who is not at risk. Find the smallest number of days needed to vaccinate everyone. Input The first line of the input contains a single integer  T T  denoting the number of test cases. The description of  T T  test cases follows. The first line of each test case contains two space-separ

Codechef February long challenge solution 2021

   Codechef February  long challenge solution 2021- Hey guys Welcome Again, A small update CodeChef February  long challenge solution 2021 starting from 1st week of beb  2021 . Codechef long challenge is one of the popular contests of CodeChef you should participate in codechef Feb  long challenge.This is first contest of codechef in 2021 so good luck. And wish you happy new year. Contest link- I will post the solution after Contest.Stay tuned. About CodeChef  February  long challenge solution 2021: CodeChef Long Challenge is a 10-day monthly coding contest where you can show off your computer programming skills. The significance being - it gives you enough time to think about a problem, try different ways of attacking the problem, read the concepts etc. If you’re usually slow at solving problems and have ample time at hand, this is ideal for you. We also put in a lot of efforts in getting quality problems, w

Merge Two sorted array Without Extra Space

Problem statement-  Given two sorted arrays arr1[] and arr2[] of sizes N and M in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.    Example 1: Input:  N = 4, arr1[] = [1 3 5 7]  M = 5, arr2[] = [0 2 6 8 9] Output:  arr1[] = [0 1 2 3] arr2[] = [5 6 7 8 9] Explanation: After merging the two  non-decreasing arrays, we get,  0 1 2 3 5 6 7 8 9.   Example 2: Input:  N = 2, arr1[] = [10, 12]  M = 3, arr2[] = [5 18 20] Output:  arr1[] = [5 10] arr2[] = [12 18 20] Explanation: After merging two sorted arrays  we get 5 10 12 18 20. Your Task: You don't need to read input or print anything. You only need to complete the function merge() that takes arr1, arr2, N and M as input parameters and modifies them in-place so that they look like the sorted merged array when concatenated. Expected Time Complexity:  O((n+m) log(n+m)) Expected Auxilliary Space: O(1