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>

  • 相关阅读:
    [转载] VsCode中使用Emmet神器快速编写HTML代码
    Hexo 博客部署到私有云服务器
    钉钉小程序通过 Canvas 将页面生成图片并保存到本地相册
    2021你应该了解的前端知识体系
    JavaScript 中的模块化
    vue中click事件方法不加括号则会将事件作为入参
    css:左右元素没对齐,调整子元素的vertical-align属性
    js通过宽高特征对图片进行分类
    配置服务器上的git仓库
    js获取当前设备信息
  • 原文地址:https://www.cnblogs.com/codeyuan/p/4254525.html
Copyright © 2011-2022 走看看