「Luogu P2624」[HNOI2008]明明的烦恼 - Prufer Sequence

给出标号为 1 到 N 的点,以及某些点最终的度数

允许在任意两点间连线,可产生多少棵度数满足要求的树?

`n \le 1000`

Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

×