Tournament Graph Distribution

CSESCounting ProblemsOpen on judge ↗

A tournament graph is a directed graph where a single directed edge exists between every pair of nodes. Given n, your task is to calculate for each k = 1 \dots n the number of tournament graphs that have n nodes and k strongly connected components. Input The only line has an integer n: the number of nodes. Output Print n lines: for each k=1 \dots n the number of graphs modulo 10^9+7. Constra

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