Crazy Catalan

CodeChefOpen on judge ↗

Mittal and Mitali are friends. Mitali wants to go on a trip with Mittal but Mittal asked Mitali to solve a problem if she wants to go on a trip with him. Mittal gives Mitali $N$ distinct numbers of Catalan Number Series after skipping first $2$ number of the given series, i.e. $(1,1)$. He asked Mitali to arrange those $N$ distinct catalan numbers at $M$ places in a **non-decreasing sequence (with

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