zoukankan      html  css  js  c++  java
  • Sum It Up_状态压缩

    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
     

     【题意】给出一个sum,n个数,求有n个数组合成sum的方法

    #include<iostream>
    #include<stdio.h>
    #include<string.h>
    using namespace std;
    
    int a[50];
    int ans[50];
    int sum,n;
    int flag;
    
    void dfs(int x,int cnt,int m)//x是当前所在的位置,cnt是当前的和m由cnt-1个数构成
    {
        if(m>sum) return;
        if(m==sum)
        {
            flag=1;
            for(int i=1;i<cnt;i++)
            {
                if(i==cnt-1)
                    printf("%d
    ",ans[i]);
                else printf("%d+",ans[i]);
            }
        }
        int k=-1;
        for(int i=x;i<=n;i++)
        {
            if(k!=a[i])
            {
                ans[cnt]=a[i];
                k=a[i];
                dfs(i+1,cnt+1,m+a[i]);
            }
        }
        return ;
    }
    
    int main()
    {
        while(scanf("%d%d",&sum,&n),sum||n)
        {
            for(int i=1;i<=n;i++)
            {
                scanf("%d",&a[i]);
            }
            printf("Sums of %d:
    ",sum);
            flag=0;
            dfs(1,1,0);
            if(!flag)
                printf("NONE
    ");
        }
        return 0;
    }
  • 相关阅读:
    day26
    day 25
    java.io.IOException: java.net.ConnectException: Call From master/192.168.58.128 to master:10020 failed on connection exception: java.net.ConnectException: 拒绝连接;
    疫情可视化系统
    使用eclipse创建spring cloud的eureka客户端和eureka服务端
    连接虚拟机的hive时进程自动杀死
    在Ubuntu18.04的Docker中安装Oracle镜像及简单使用
    Ubuntu16.04 上Docker 中安装SQL Server 2017
    docker
    Docker镜像报错
  • 原文地址:https://www.cnblogs.com/iwantstrong/p/6370843.html
Copyright © 2011-2022 走看看