zoukankan      html  css  js  c++  java
  • DFS Sum It Up

    HDU 1258    Sum It Up  

    http://acm.hdu.edu.cn/showproblem.php?pid=1258

    Sum It Up

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


    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
     
    Source
     

    这题搞了一个晚上,不过一直没搞出来,后来看了一下别人AC代码,然后自己写了一个,写的有点丑,不过这代码对于重判处理的还是很好的。

     1 #include<stdio.h>
     2 int t,n,a[100],ans[100],flag;
     3 void dfs(int i,int j,int k)//i是a数组的下标,j是记录数组的下标,k就是和
     4 {
     5      int p;
     6      int pre=-1;
     7      if(k==t)
     8      {
     9           flag=1;
    10           for(p=0;p<j;p++)
    11            printf("%d%c",ans[p],p==j-1?'
    ':'+');
    12            return ;
    13      }
    14      for(p=i;p<n;p++)
    15      {
    16           //printf("a[%d]=%d
    ",p,a[p]);
    17           if(k+a[p]>t)
    18           continue;
    19          if(a[p]!=pre)
    20           {
    21                pre=a[p];
    22                ans[j]=a[p];
    23                dfs(p+1,j+1,k+a[p]);
    24           }
    25      }
    26      return;
    27 }
    28 int main()
    29 {
    30      int i;
    31      while(scanf("%d %d",&t,&n)!=EOF)
    32      {
    33           flag=0;
    34           if(n==0)
    35           break;
    36           for(i=0;i<n;i++)
    37               scanf("%d",&a[i]);
    38               printf("Sums of %d:
    ",t);
    39               dfs(0,0,0);
    40               if(!flag)
    41               printf("NONE
    ");
    42 
    43      }
    44      return 0;
    45 }
    View Code
  • 相关阅读:
    在Linux下安装和使用MySQL
    vc动态装载动态库
    stl学习(转帖2)
    makefile
    详细的MySQL C API
    Excel INTO SQLSERVER
    Outlook2010中预览Word,Excel附件问题
    11gRAC ASM管理的数据文件丢失恢复
    ASM上控制文件损坏时的恢复
    使用NET USER增加一个超级管理 & 激活Windows 7 administrator
  • 原文地址:https://www.cnblogs.com/llei1573/p/3198416.html
Copyright © 2011-2022 走看看