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

一共n条边啊,每条边最多与其他n-1条边相交,所以结果是O(n^2)的

Posted by checkoj at 2011-12-21 02:26:39 on Problem 1277
In Reply To:问一下32767的答案是48023737436053505吗? Posted by:glaver at 2004-05-20 18:22:40
怎么会这么大

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