poj 1564 Sum It Up 【DFS】【求和为N的所有数的组合】

最新推荐文章于 2021-12-08 08:58:35 发布

笑着走完自己的路

最新推荐文章于 2021-12-08 08:58:35 发布

阅读量710

点赞数

分类专栏： DFS && BFS

本文链接：https://blog.csdn.net/chenzhenyu123456/article/details/47292043

版权

该博客介绍了如何使用深度优先搜索（DFS）算法找出M个数中和为N的所有不重复组合。内容包括问题描述、输入输出示例及AC代码，帮助读者理解如何利用DFS解决此类组合问题。

摘要由CSDN通过智能技术生成

Sum It Up

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 6622		Accepted: 3438

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.

Input

The input will contain one or more test ca