← All problemsSign in

Vacation Clothes

CodeChefRating 177Open on judge ↗

Chef is going on a vacation for $N$ days. Each day, he must wear a fresh set of clothes. Whenever a set is worn on day $d$, it is sent for cleaning and becomes available again only on day $d + 7$. A set that returns from cleaning on some day may be worn again that same day. What is the minimum number of sets of clothes Chef must carry so that he always has something to wear for all $N$ days? #

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

Sign in to chat with the tutor and save your progress.

Sign in to start