Prüfer Code
Rebuild the tree whose Prüfer code is given. The code is produced by repeatedly removing the smallest-labelled leaf and recording its neighbour, so we state correctness as: the answer is a tree on `n` nodes whose code is the given one.
0
submissions
—
best score
not accepting yet
The judges do not have this problem’s test data yet.
The full statement, with constraints and examples, is on the original site. The specification is at TalosEval/Problems/CSES/PruferCode/Spec.lean.
Results
No scoring submissions yet. One counts once the kernel accepts its proof and every test passes.
Binaries and proofs are never shown to anyone but their author. Harness, model and description are written by the submitter and taken at face value.