Chef And Division Three(DIVTHREE)Solution — Codechef JanuaryLong Challenge

Anubhav Mishra
2 min readJan 10, 2021

--

Problem Statement

Chef wants to host some Division-3 contests. Chef has N setters who are busy creating new problems for him. The ith setter has made Ai problems where 1≤i≤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 A1,A2,…,AN 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≤T≤103
  • 1≤N≤102
  • 1≤K≤109
  • 1≤D≤109
  • 1≤Ai≤107 for each valid i

Subtasks

Subtask #1 (40 points):

  • N=1
  • 1≤A1≤105

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 A1=4A1=4 problems and he needs K=5K=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 00.
  • Example case 2: Chef has A1=23A1=23 problems and he needs K=10K=10 problems for a Division-3 contest. Chef can choose any 10+10=2010+10=20 problems and host 22 Division-3 contests in these 3 days. Hence the second output is 22.
  • Example case 3: Chef has A1=20A1=20 problems from setter-1 and A2=36A2=36 problems from setter-2, and so has a total of 5656 problems. Chef needs K=5K=5 problems for each Division-3 contest. Hence Chef can prepare 1111 Division-3 contests. But since we are planning only for the next D=7D=7 days and Chef cannot host more than 11 contest in a day, Chef cannot host more than 77 contests. Hence the third output is 77.

Code (Solution)

The code has been implemented in Java.

import java.util.*;

class Codechef
{
public static void main (String[] args) throws java.lang.Exception
{

Scanner sc = new Scanner(System.in);
int t = sc.nextInt();

while(t-- > 0){
int n = sc.nextInt();
int k = sc.nextInt();
int d = sc.nextInt();
int count,sum =0;

}

if(sum < k){
System.out.println("0");

}
else if(sum==k){
System.out.println("1");

}
else{
count = sum / k;
if(count <= d)
System.out.println(count);
else
System.out.println(d);
}

}
}
}

Hope you would have liked the article. Please give a clap to this article and follow me for more future programming related blogs.

References

https://www.codechef.com/JAN21C/problems/DIVTHREE

Sign up to discover human stories that deepen your understanding of the world.

Free

Distraction-free reading. No ads.

Organize your knowledge with lists and highlights.

Tell your story. Find your audience.

Membership

Read member-only stories

Support writers you read most

Earn money for your writing

Listen to audio narrations

Read offline with the Medium app

--

--

Anubhav Mishra
Anubhav Mishra

Written by Anubhav Mishra

Software Engineer , Having my degree B.Tech in Information Technology from BVCOE, New Delhi. Love new Technologies. Electronic Dance Music is love.

No responses yet

Write a response