Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:请问N个结点的二叉树有多少种结构.

Posted by lzqxh at 2011-08-11 13:37:14 on Problem 1095
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:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator