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

O(n^0.5)都超时.到底要怎样的复杂度才能过.....

Posted by Loger at 2004-11-24 20:40:04 on Problem 2100 



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