An Odd Question

CodeChefOpen on judge ↗

*Odd graph* is a graph having odd number of edges. You're given a [complete graph](https://en.wikipedia.org/wiki/Complete_graph) having $N$ nodes (numbered $1$ through $N$). You can convert this graph into an *odd graph* by removing a set of edges. Find the total number of ways to convert given graph into an *odd graph* $($modulo $10^9+7)$. **Note:** Two ways are considered different, if

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