zoukankan      html  css  js  c++  java
  • I深搜

    <span style="color:#330099;">/*
    I - 深搜 基础
    Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u
    Submit
     
    Status
    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
    By Grant Yuan
    2014.7.14
    */
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cstdlib>
    #include<cmath>
    #include<queue>
    #include<stack>
    using namespace std;
    int a[13];
    int fre[13];
    int ffre[100];
    int t,n;
    int s[100];
    bool mark;
    int num;
    int top;
    int top1;
    int sum;
    int first;
    void sort()
    {int t1;
        for(int i=0;i<top1;i++)
           for(int j=i;j<=top1;j++)
             {
                 if(a[i]<a[j]){
                     t1=a[i],a[i]=a[j],a[j]=t1;
                     t1=fre[i],fre[i]=fre[j],fre[j]=t1;
                 }
             }
    }
    
    void pt()
    {   int bear=0;
        for(int i=0;i<=top;i++)
    
              if(ffre[i]){
                for(int j=1;j<=ffre[i];j++)
                 {  if(bear==0)
                   {
                       cout<<s[i];
                       bear=1;}
                    else
                       printf("+%d",s[i]);}
    
          }
          cout<<endl;
    }
    
    void dps(int k)
    {
        if(k>top1){
          if(sum==t)
             {mark=1;
             if(first==0)
             printf("Sums of %d:
    ",t);
               first=1;pt();num++;}
          return;
            }
        for(int i=fre[k];i>=0;i--)
        {if(sum+a[k]*i<=t){
          s[++top]=a[k];
          ffre[top]=i;
          sum+=a[k]*i;
          dps(k+1);
          top--;
          sum-=a[k]*i;
          }
        
          }
    }
    
    int main()
    {
        while(1){
          cin>>t>>n;
          top1=-1;
          top=-1;
          sum=0;
          first=0;
          mark=0;
          memset(fre,0,sizeof(fre));
          memset(ffre,0,sizeof(ffre));
          num=0;
          if(n==0)
             break;
          int m;
          bool flag1;
          for(int i=0;i<n;i++)
            {flag1=0;
                cin>>m;
                for(int j=0;j<=top1;j++)
                  {
                      if(m==a[j])
                        flag1=1,fre[j]++;
                  }
                  if(flag1==0)
                   {a[++top1]=m;
                     fre[top1]=1;}}
         sort();
          dps(0);
          if(mark==0)
            {printf("Sums of %d:
    ",t);
            printf("NONE
    ");}
          }
          return 0;
    }
    </span>

  • 相关阅读:
    [Nginx] 解决跨域been blocked by CORS policy: No 'Access-Control-Allow-Origin' header is present on the requested resource.
    [GO项目]开源免费在线客服系统-真正免费开源-GOFLY0.3.2发布-极简强大Go语言开发网页客服
    [PHP] php使用curl_multi_exec并行同时执行http请求
    [PHP] PHP redis滑动窗口频率限制
    [PHP] xml转为数组函数
    [javascript] 全国省市县JSON/XML数据(包含台湾和海外国家一级)
    [MySQL] 注意MySQL5.1不支持utf8mb4 Error 1115: Unknown character set: 'utf8mb4'
    [Go] linux下安装go1.16
    [GO项目]开源免费在线客服系统-真正免费开源-GOFLY0.2.9发布-极简强大Go语言开发网页客服
    [PHP]PHP不支持方法重载和只支持方法覆盖
  • 原文地址:https://www.cnblogs.com/codeyuan/p/4254525.html
Copyright © 2011-2022 走看看