Cars

CodeChefOpen on judge ↗

Problem description: There are N linear tracks each of length (2*Ai) Meters. The midpoints of all tracks lie on the same point. None of the tracks coincide with each other. Now a car starts from each of the N tracks from one end point, moves to the next end point and, comes back again and so on. Each car travells with unit speed ie 1 Meter/sec. Find out the maximum number of cars which will be pr

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