zoukankan      html  css  js  c++  java
  • ZOJ 1711 H-Sum It Up

    https://vjudge.net/contest/67836#problem/H

    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 file 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 x 1 , . . . , x n . 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 x 1 , . . . , x n 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 distinct; the same sum cannot 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

    时间复杂度:$O(2^n)$

    题解:dfs , 按照字典序输出

    代码:

    #include <bits/stdc++.h>
    using namespace std;
    
    int t, n, add, cnt;
    int a[15], key[15], vis[15];
    
    struct Ans{
        int b[15];
        int len;
    }ans[4200];
    int sz;
    
    bool cmp2(const Ans& a, const Ans& b) {
        for(int i = 0; i < min(a.len, b.len); i ++) {
            if(a.b[i] != b.b[i]) return a.b[i] > b.b[i];
        }
        return a.len > b.len;
    }
    
    bool cmp(int n1, int n2) {
        return n1 > n2;
    }
    
    void dfs(int x, int sum) {
        if(sum > t) return;
        if(x == n + 1) {
            if(sum == t) {
                ans[sz].len = 0;
                for(int i = 1; i <= n; i ++) {
                    if(key[i]) {
                        ans[sz].b[ans[sz].len ++] = a[i];
                    }
                }
                sz ++;
            }
            return;
        }
        key[x] = 1;
        dfs(x + 1, sum + a[x]);
        key[x] = 0;
        dfs(x + 1, sum);
    }
    
    int main() {
        while(~scanf("%d %d", &t, &n)) {
            if(n == 0)
                break;
    
            for(int i = 1; i <= n; i ++) {
                scanf("%d", &a[i]);
            }
    
            sort(a + 1, a + 1 + n, cmp);
            sz = 0;
            dfs(1, 0);
            printf("Sums of %d:
    ", t);
            if(sz) {
                sort(ans, ans + sz, cmp2);
                for(int i = 0; i < sz; i ++) {
                    int fail = 1;
                    if(i == 0) fail = 0;
                    else {
                        if(ans[i].len != ans[i - 1].len) fail = 0;
                        for(int j = 0; j < ans[i].len; j ++) {
                            if(ans[i].b[j] != ans[i - 1].b[j])
                                fail = 0;
                        }
                    }
                    if(fail)
                        continue;
    
                    for(int j = 0; j < ans[i].len; j ++) {
                        if(j != 0) printf("+");
                        printf("%d", ans[i].b[j]);
                    }
                    printf("
    ");
                }
            } else {
                printf("NONE
    ");
            }
        }
        return 0;
    }
    

      

  • 相关阅读:
    【Redis过期Key监听】
    【ElasticSearch】ES线上脏数据处理
    【MySQL】实现线上千万数据表添加字段操作以及缓存刷新
    【转】【堆外内存】堆内内存与堆外内存
    【Redis连接超时】记录线上RedisConnectionFailureException异常排查过程
    【ElasticSearch】ES 读数据,写数据与搜索数据的过程
    【ElasticSearch】shards,replica,index之间的关系
    tomorrow多线程启动
    request接口下载附件
    request接口上传附件
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9529115.html
Copyright © 2011-2022 走看看