Making Friends

CodeChefOpen on judge ↗

In the first year Akar wanted to make as many friends as possible. So, He used this strategy for sitting in the class everyday. He sits in such a way so that every day his adjacent persons are different. Now everyone in the class wants to follow this strategy and make as many friends as possible. For how many days they will be able to sit in this way? In DA we know we have big LT but here assume w

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