Maximum Matching

CodeChefRating 3034Open on judge ↗

Devu is very frustrated with the following problem. So, he wants your help in solving it. Given a set: S = {1,2,3,....,N} Make a bipartite graph having partites X and Y. Partite X will contain all permutations of Set S. Partite Y will contain all strings of length (N-1) having characters ‘I’ and ‘D’ only. Note that number of vertices in partite X will be N! and 2(N-1) in partite Y. Con

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