zoukankan      html  css  js  c++  java
  • L

    L - Sum It Up

    Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

    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 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

    //一般的bfs,关键的在于同一个位置不能放同样的数。

     

     1 #include <iostream>
     2 #include <algorithm>
     3 using namespace std;
     4 
     5 int num[15];
     6 int way[15];
     7 int T,N;
     8 int all,all_ti;
     9 
    10 void dfs(int now)
    11 {
    12     if (all==T)
    13     {
    14         int i=1;
    15         for (;i<=N;i++)
    16         {
    17             if (way[i]==1)
    18             {
    19                 cout<<num[i];
    20                 break;
    21             }
    22         }
    23         for (i++;i<=N;i++)
    24         {
    25             if (way[i]==1)
    26             {
    27                 cout<<"+"<<num[i];
    28             }
    29         }
    30         cout<<endl;
    31 
    32         all_ti++;
    33         way[now]=0;
    34         all-=num[now];
    35     }
    36     else
    37     {
    38         int last=-1;
    39         for (int j=now;j<=N;j++)
    40         {
    41             if (way[j]==0 && num[j]+all<=T&&last!=num[j])
    42             {
    43                 last=num[j];
    44                 way[j]=1;
    45                 all+=num[j];
    46                 dfs(j);
    47 
    48             }
    49         }
    50         way[now]=0;
    51         all-=num[now];
    52     }
    53 
    54 }
    55 
    56 int cmp(int x,int y)
    57 {return x>y;}
    58 
    59 
    60 int main()
    61 {
    62 
    63     while (cin>>T>>N)
    64     {
    65         if (N==0) break;
    66         all=all_ti=0;
    67         for (int i=1;i<=N;i++)
    68         {
    69             cin>>num[i];
    70             way[i]=0;
    71         }
    72         sort(num+1,num+1+N,cmp);
    73         cout<<"Sums of "<<T<<":"<<endl;
    74         dfs(1);
    75         if (all_ti==0) cout<<"NONE"<<endl;
    76 
    77     }
    78     return 0;
    79 }
    View Code

     

     

     



  • 相关阅读:
    关于在Eclipse中使用正则表达式替换的一点记录(使用正则表达式的分组)
    C#学习笔记(六):可空类型、匿名方法和迭代器
    C#学习笔记(五):泛型
    C#学习笔记(四):委托和事件
    C#学习笔记(三):值类型、引用类型及参数传递
    C#学习笔记(二):继承、接口和抽象类
    Unity3D之AssetBundle学习:Android上运行笔记
    js arguments 内置对象
    JS面向对象高级特性
    js 阻止事件冒泡 支持所有主流浏览器
  • 原文地址:https://www.cnblogs.com/haoabcd2010/p/5676773.html
Copyright © 2011-2022 走看看