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 |
一共n条边啊,每条边最多与其他n-1条边相交,所以结果是O(n^2)的In Reply To:问一下32767的答案是48023737436053505吗? Posted by:glaver at 2004-05-20 18:22:40 怎么会这么大 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator