Subhra and his trip

CodeChefOpen on judge ↗

Subhra is a very lucky boy. This year he has won $N$ free flight tickets from distinct airlines. As he loves to travel he has already planned a trip involving N flights. Since Subhra is busy in packing, help him to figure out the total no of ways he can schedule his flights. Example:If he has won 3 passes from Flights F1,F2, and F3 he can travel as F1->F2->F3 F1->F3->F2 F2->F1->F3 F2->F2->

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