| ||||||||||
| 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 | |||||||||
Re:请问N个结点的二叉树有多少种结构.In Reply To:请问N个结点的二叉树有多少种结构. Posted by:eastup at 2005-12-19 12:12:11 data[0] = data[1] = 1;
int sum = 1;
cnt = 1;
while ( sum <500000000 )
{
cnt++;
for (int j = 0; j<cnt; j++ ) data[cnt] += data[j] * data[cnt-1-j];
sum += data[cnt];
}
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator