Quality Work

CodeChefOpen on judge ↗

You are to perform a total of $N$-tasks. There is a certain magnitude associated with each task. You have to maintain a constant quality of $Q$ for all tasks. The number of days taken to perform the $i$-th task is $ceil(i* \ M_i *Q)$ where $ \ M_i$ is the magnitude of the task. You have to perform all the tasks under $K$ days. Your job is to find the maximum integral quality $Q$ that can

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI