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:复杂度是O(n * log n * log n)，不要写错左右。

Posted by a280920481 at 2019-01-15 22:59:34 on Problem 2886 and last updated at 2019-01-15 22:59:56
In Reply To:复杂度是O(n * log n * log n)，不要写错左右。 Posted by:a280920481 at 2019-01-15 22:54:45 
寻找因数的过程类比素数筛，复杂度是：
O(
n/1 + n/2 + n/3 + n/4 + ... + n/(n-1) + n/n
)

当作函数积分一下，就是 n * log n
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