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

    不含回溯,看了标程后 AC 的,标程的代码很短,处理相同解的方法比较好。

    View Code
    # include <cstdio>
    
    # define N 12 + 5
    
    bool find;
    int t, n, a[N], solu[N];
    
    void dfs(int sum, int p, int cnt)
    {
        if (sum > t) return ;
        if (sum == t)
        {
            find = true;
            printf("%d", solu[0]);
            for (int i = 1; i < cnt; ++i)
                printf("+%d", solu[i]);
            putchar('\n');
            return ;
        }
        int cur = -1;
        for (int i = p; i < n; ++i)
        {
            if (sum+a[i] <= t && a[i] != cur)
            {
                cur = solu[cnt] = a[i];
                dfs(sum+a[i], i+1, cnt+1);
            }
        }
    }
    
    void init(void)
    {
        for (int i = 0; i < n; ++i)
            scanf("%d", &a[i]);
    }
    
    void solve(void)
    {
        find = false;
        dfs(0, 0, 0);
        if (find == false) puts("NONE");
    }
    
    int main()
    {
        while (1)
        {
            scanf("%d%d", &t, &n);
            if (!t && !n) break;
            printf("Sums of %d:\n", t);
            init();
            solve();
        }
    
        return 0;
    }

    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
    
  • 相关阅读:
    cshtml常用标签
    模板方法模式(Template Method)
    day10-python-协程异步IORabbitMQ队列 edis缓存
    Gitlab+Jenkins自动化部署
    day9-python-进程、线程和协程
    day8-python-socket编程
    day7-python-面向对象进程进阶
    day6-python-面向对象
    day5-python-常用模块
    zabbix监控rabbitmq
  • 原文地址:https://www.cnblogs.com/JMDWQ/p/2598137.html
Copyright © 2011-2022 走看看