{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e \u003cspan\u003e\u003ca href\u003d\"http://7xjob4.com1.z0.glb.clouddn.com/5009d7f10e6c19e489c718c7c507e18e\"\u003e \u003cimg alt\u003d\"Download as PDF\" height\u003d\"26\" src\u003d\"http://uva.onlinejudge.org/components/com_onlinejudge/images/button_pdf.png\" title\u003d\"Download as PDF\" width\u003d\"100\"\u003e\u003c/a\u003e\u003c/span\u003e\u003c/p\u003e \n\u003cp\u003e \u0026nbsp;\u003c/p\u003e \n\u003cp\u003e \u003cspan\u003e给出一棵n\u003c/span\u003e(1\u0026lt;\u003dn\u0026lt;\u003d500000)个结点的有根树,要求给结点标号1-n,使得不同结点的标号不同,且每个非根节点的标号比父结点小,求方案总数除以m的余数(2\u0026lt;\u003dm\u0026lt;\u003d10^9)\u003c/p\u003e"}}]}