Rinku likes Soup

CodeChefOpen on judge ↗

Ankit attends a party with Simmi, his classmate. Both of them are going to have dinner. On seeing this, Rinku gets jealous of Ankit and decides to trick him. He goes to Ankit and asks him to solve a problem. There are $N$ varieties of soup in the party and $N$ identical bowls are placed on Simmi's plate. Rinku has a favorite number $max$ and Simmi's favorite number is $2$. Rinku asks Ankit to tell

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