 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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:Re:这道题应该可以用DP 呀！可是我还是没有AC，哪位大牛帮忙看一下！ Posted by:nancyyihao at 2010-01-10 12:44:04 > {思路是先把能组合的方案求出来，定义f[i]为能组合出i的方案的种数，
> ans=min(sum div f[i]);
> }
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
