Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
预先把各个节点所能形成的树的个数放到一个数组里In Reply To:看了题目懂了, 但是没有好的思路. 大虾帮助下啊! 谢谢. Posted by:yogafrank at 2007-07-29 11:59:12 long c[19]={1,1,2,5,14,42,132,429,1430,4862,16796,58786,208012,742900,2674440,9694845,35357670,129644790,477638700}; 这是怎么计算的呢? Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator