阅读背景:

hdu1258 Sum It Up (DFS)_青山绿水之辈 专栏

来源:互联网 
Problem Description
Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4, n=6, and the list is [4,3,2,2,1,1], then there are four different sums that equal 4: 4,3+1,2+2, and 2+1+1.(A number can be used within a sum as many times as it appears in the list, and a single number counts as a sum.) Your job is to solve this problem in general. Given a specif



你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: