Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
关于不用取模的另一种方法那就是利用二进制思想,把个数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: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator