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

关于不用取模的另一种方法

Posted by dearbear at 2009-07-20 22:39:25 on Problem 1014
那就是利用二进制思想,把个数k化为1,2,4,...,2^(k-1),n[i]-2^k+1,且k是满足n[i]-2^k+1>0个玻璃球。这样超级快。32MS。
浙大DD牛(08届新生)的背包九讲。好东西。

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