Run Anjali Run

CodeChefOpen on judge ↗

Anjali is given a Distance M to run from one place to another place. Due to her asthma problem, at ith day she can run up to at most X distance. Suppose there are N days in a year. Assume she run optimally, you need to output the minimum day number to reach the destination Input The first input line contains the T number of test cases. Each testcase consist of three lines First line consist of

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