## Chef and Division 3  Codechef january challenge solution || Chef and Division 3  Codechef january challenge Editorial-

### Problem statement-

Chef wants to host some Division-3 contests. Chef has $N$ setters who are busy creating new problems for him. The ${i}^{th}$ setter has made ${A}_{i}$ problems where $1\le i\le N$.

A Division-3 contest should have exactly $K$ problems. Chef wants to plan for the next $D$ days using the problems that they have currently. But Chef cannot host more than one Division-3 contest in a day.

Given these constraints, can you help Chef find the maximum number of Division-3 contests that can be hosted in these $D$ days?

### Input:

• The first line of input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
• The first line of each test case contains three space-separated integers - $N$$K$ and $D$ respectively.
• The second line of each test case contains $N$ space-separated integers ${A}_{1},{A}_{2},\dots ,{A}_{N}$ respectively.

### Output:

For each test case, print a single line containing one integer ― the maximum number of Division-3 contests Chef can host in these $D$ days.

### Constraints

• $1\le T\le {10}^{3}$
• $1\le N\le {10}^{2}$
• $1\le K\le {10}^{9}$
• $1\le D\le {10}^{9}$
• $1\le {A}_{i}\le {10}^{7}$ for each valid $i$

• $N=1$
• $1\le {A}_{1}\le {10}^{5}$

Subtask #2 (60 points): Original constraints

### Sample Input:

5
1 5 31
4
1 10 3
23
2 5 7
20 36
2 5 10
19 2
3 3 300
1 1 1


### Sample Output:

0
2
7
4
1


### Explanation:

• Example case 1: Chef only has ${A}_{1}=4$ problems and he needs $K=5$ problems for a Division-3 contest. So Chef won't be able to host any Division-3 contest in these 31 days. Hence the first output is $0$.

• Example case 2: Chef has ${A}_{1}=23$ problems and he needs $K=10$ problems for a Division-3 contest. Chef can choose any $10+10=20$ problems and host $2$ Division-3 contests in these 3 days. Hence the second output is $2$.

• Example case 3: Chef has ${A}_{1}=20$ problems from setter-1 and ${A}_{2}=36$ problems from setter-2, and so has a total of $56$ problems. Chef needs $K=5$ problems for each Division-3 contest. Hence Chef can prepare $11$ Division-3 contests. But since we are planning only for the next $D=7$ days and Chef cannot host more than $1$ contest in a day, Chef cannot host more than $7$ contests. Hence the third output is $7$.

### Solution-

This problem can be solve using brute force approach.
calculate sum of array and print cout<<min(sum/k,d)<<endl;
here is my code-

Join telegram channel for code and editorial.-https://t.me/competitiveProgrammingDiscussion

### 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- https://www.codechef.com/FEB21/?itm_medium=navmenu&itm_campaign=FEB21 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