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

    Sum It Up

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


    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
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 #include<algorithm>
     5 using namespace std;
     6 const int maxn = 1010;
     7 int t,n;
     8 int a[maxn],ove[maxn];
     9 int flg;
    10 
    11 void DFS(int cur,int sum,int cnt){
    12     if(sum>t) return ;
    13     if(sum==t){
    14         printf("%d",ove[0]);
    15         for( int i=1; i<cnt; i++ ){
    16             printf("+%d",ove[i]);
    17         }
    18         printf("
    ");
    19         flg=1;
    20     }
    21     for( int i=cur; i<n; i++ ){
    22         ove[cnt]=a[i];
    23         DFS(i+1,sum+a[i],cnt+1);
    24         while(i+1<n&&a[i]==a[i+1]){/*去除相同的分解式*/
    25             i++;
    26         }
    27     } 
    28 }
    29 int main(){
    30     while(~scanf("%d%d",&t,&n)&&n){
    31         for( int i=0; i<n; i++ ){
    32             scanf("%d",a+i);
    33         }
    34         printf("Sums of %d:
    ",t);
    35         flg=0;
    36         DFS(0,0,0);
    37         
    38         if(!flg) printf("NONE
    ");
    39     }
    40     return 0;
    41 }
    有些目标看似很遥远,但只要付出足够多的努力,这一切总有可能实现!
  • 相关阅读:
    PHP7还没学明白,PHP8就要来了, 能有多快?
    Linux ab 压力测试
    大公司为什么都有API网关?没你想的那么简单!
    mac安装的vagrant访问laraval欢迎页面,执行时间15秒,安装nfs挂载点(亲测可行)
    PHP操作Elasticsearch
    PHP OpenSSL扩展 对称加密
    为什么 select count(*) from t,在 InnoDB 引擎中比 MyISAM 慢?
    Redis哨兵机制
    未来三五年,社会上什么工作会更吃香呢?这几方面
    自己的 Doxyfile 模板
  • 原文地址:https://www.cnblogs.com/Bravewtz/p/10568143.html
Copyright © 2011-2022 走看看