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 |
Re:我初学,看不出这道题的复杂之处,请大伙给我指点一下In Reply To:我初学,看不出这道题的复杂之处,请大伙给我指点一下 Posted by:wangguanzzz at 2007-03-05 11:05:01 > 我觉得先把所有的切好的长度都加一起,从数组中最大的那个,不断加一,最小的能除尽总长的那个不就是答案嘛?? > 请大人们指点一下为什么不能这么算 设整除后得n,即有n根整木棒,还得保证将碎木棒分成n堆后,每一堆内的碎木棒长度之和等于整木棒. Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator