Weekly Tasks

CodeChefOpen on judge ↗

Given N tasks and number of tasks that Chef can do per day of a week. Number of tasks that can be done per day are given in the form of an array A, with $A_{i}$ as the number of tasks on the $ith$ day ($1 \leq i \leq 7$). Find the day on which the N tasks are going to be finally completed. ### Input - First line consists of a single integer T, number of test cases. - First line of each test case

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