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:除了容斥原理还有别的做法能过么?搜索、DP可不可以?

Posted by 547880119 at 2010-04-10 20:10:53 on Problem 2356
In Reply To:除了容斥原理还有别的做法能过么?搜索、DP可不可以? Posted by:soonyu at 2009-06-07 16:37:33
> 我用DP做  O(n^2)的   剪枝是如果输入有N的倍数就直接输出   结果LTE
> 
> 不知道有没有别的算法好使啊?
输入数据N10000 , n2的算法怎么过的了?

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