← All problemsSign in

Functional Graph Distribution

CSESCounting ProblemsOpen on judge ↗

A functional graph is a directed graph where each node has outdegree 1. For example, here is a functional graph that has 9 nodes and 2 components: Given n, your task is to calculate for each k=1 \dots n the number of functional graphs that have n nodes and k components. Input The only input line has an integer n: the number of nodes. Output Print n lines: for each k=1 \dots n the number of gr

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

Sign in to chat with the tutor and save your progress.

Sign in to start