Johto League

CodeChefOpen on judge ↗

Ash is about to take on his long-time rival, Gary Oak, in the next battle of the Johto League Silver Conference and he's determined to do everything he can to win. The pokemons are given $N$ cards. Their task is to find the $total$ number of ways such that $2$ $cards$ always face the $front$ and $2$ $cards$ always face $backwards.$ Whoever cracks it first, will be close to victory. Help As

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