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)的,想一想你的total乘出来会有多大.

Posted by xfxyjwf at 2005-06-14 19:31:53 on Problem 1026
In Reply To:这道题我用置换群的算法求最小循环因子,o(n)的复杂度,为什么还要超时,有大量的io吗? Posted by:cpp051300448324 at 2005-06-14 19:10:11
2^100?
2*3*5*7*11*13*17*19....=?

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