HDU 1258

原创 2015年07月10日 21:59:11
Sum It Up


Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4874    Accepted Submission(s): 2553

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.
 
Input
The input will contain one or more test cases, one per line. Each test case contains t, the total, followed by n, the number of integers in the list, followed by n integers x1,...,xn. If n=0 it signals the end of the input; otherwise, t will be a positive integer less than 1000, n will be an integer between 1 and 12(inclusive), and x1,...,xn will be positive integers less than 100. All numbers will be separated by exactly one space. The numbers in each list appear in nonincreasing order, and there may be repetitions.
 
Output
For each test case, first output a line containing 'Sums of', the total, and a colon. Then output each sum, one per line; if there are no sums, output the line 'NONE'. The numbers within each sum must appear in nonincreasing order. A number may be repeated in the sum as many times as it was repeated in the original list. The sums themselves must be sorted in decreasing order based on the numbers appearing in the sum. In other words, the sums must be sorted by their first number; sums with the same first number must be sorted by their second number; sums with the same first two numbers must be sorted by their third number; and so on. Within each test case, all sums must be distince; the same sum connot appear twice.
 
Sample Input
4 6 4 3 2 2 1 1
5 3 2 1 1
400 12 50 50 50 50 50 50 25 25 25 25 25 25
0 0
 
Sample Output
Sums of 4:
4
3+1
2+2
2+1+1
Sums of 5:
NONE
Sums of 400:
50+50+50+50+50+50+25+25+25+25

50+50+50+50+50+25+25+25+25+25+25

//同样的dfs搜索不过需要注意答案的集合中前一个元素必须大于等于后面一个元素

//因为从大到小开始输出,可以先给输入排序再搜索

#include <stdio.h>
#include <algorithm>
using namespace std;
int n,m,flag,cnt=0;
int a[13];
int vis[13];
int c[13],k;
bool cmp(const int &a,const int &b)
{
    return a>b;
}

void dfs(int ini,int init)  //和、初始位置
{
    if(ini==n)
    {
        flag=1;
        printf("%d",c[0]);
        for(int i=1;i<cnt;i++)
            printf("+%d",c[i]);
        printf("\n");
    }
    else
    {
        for(int i=init;i<m;i++)
        {
            if(!vis[i])
            {
                ini+=a[i];
                vis[i]=1;
                c[cnt++]=a[i];
                dfs(ini,i+1);
                vis[i]=0;  //回溯
                ini-=a[i];
                cnt--;
                while(a[i]==a[i+1])  //避免重复
                    i++;
            }
        }
    }
}

int main()
{
    while(~scanf("%d%d",&n,&m)&&(n+m))
    {
        for(int i=0;i<m;i++)
        {
            scanf("%d",&a[i]);
            vis[i]=0;
        }
        sort(a,a+m,cmp);
        cnt=flag=0;
        printf("Sums of %d:\n",n);
        dfs(0,0);
        if(!flag)
            printf("NONE\n");
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

【HDU 1258】Sum It Up(DFS,去重技巧)

思路: 这道题和HDU-1342 Lotto很相似,都在DFS中套用了两层递归。1342那题规定了输出元素个数,只需求出所有排列。因此搜索出口很方便找到。而此题是要求寻找符合“和等于所给值”的所有排列...

HDU 1258 Sum it up

题意:给出n个正整数,x[1..n],对于给定的t(t < 1000),找出所有满足和为t的x的组合。降序输出。

hdu 1258 Sum It Up

Sum It Up Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Tot...

hdu 1258(深搜)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1258 Sum It Up Time Limit: 2000/1000 MS (Java/Oth...

hdu 1258 Sum It Up

Sum It Up Time Limit: 1000MS   Memory Limit: 32768KB   64bit IO Format: %I64d & %I64u ...

hdu 1258 Sum It Up

Sum It Up Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total ...

hdu 1258 Sum It Up

Problem Description Given a specified total t and a list of n integers, find all distinct sums usin...

HDU1258 POJ1564 UVA574 UVALive5319 ZOJ1711 Sum It Up【DFS】

Sum It Up Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 7926   Accepted: 4068 ...

hdu1258temp

#include"stdio.h" #include"string.h" #include"stdlib.h" int num[15]; //初始读入的那几个数 i...

hdu1258 确定比赛名次 邻接表法拓扑排序

确定比赛名次 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total S...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)