Super Friends

CodeChefOpen on judge ↗

In WBUT, there is a famous group of six foodie friends, who call themselves Super Six. Sorry, the names must be withheld. But the problem is interesting. Often they get n LADDUs from the canteen and try to calculate in how many ways they can eat them. Since all of them are foodie, everyone should get at least 1 LADDU else they will fight with the canteen members. Given n , find the number of way

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