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$N$ students (numbered 1$1$ through N$N$) participating in the Indian Programming Camp (IPC) and they watched a total of K$K$ lectures (numbered 1$1$ through K$K$). For each student i$i$ and each lecture j$j$, the i$i$-th student watched the j$j$-th lecture for Ti,j$T_{i,j}$ minutes.

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

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

Find out how many participants are eligible for a certificate.

Input

• The first line of the input contains three space-separated integers N$N$, M$M$ and K$K$.
• N$N$ lines follow. For each valid i$i$, the i$i$-th of these lines contains K+1$K+1$ space-separated integers Ti,1,Ti,2,…,Ti,K,Qi$T_{i,1},T_{i,2},\dots ,T_{i,K},Q_i$.

Output

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

Constraints

• 1≤N,K≤1,000$1\le N,K\le 1,000$
• 1≤M≤106$1\le M\le {10}^6$
• 1≤Qi≤106$1\le Q_i\le {10}^6$ for each valid i$i$
• 1≤Ti,j≤1,000$1\le T_{i,j}\le 1,000$ for each valid i$i$ and j$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

1

Explanation

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

Only participant 2$2$ receives a certificate.

link -https://www.codechef.com/COOK124B/problems/IPCCERT

Must Join My telegram channel for more editorial post-

https://t.me/competitiveProgrammingDiscussion

Solution -

this problem can be solved by using brute force approach .

Follow my code -