求和

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1258

Sample Input

4 6 4 3 2 2 1 15 3 2 1 1400 12 50 50 50 50 50 50 25 25 25 25 25 250 0

 

Sample Output

Sums of 4:43+12+22+1+1Sums of 5:NONESums of 400:50+50+50+50+50+50+25+25+25+2550+50+50+50+50+25+25+25+25+25+25

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int a[20],ans[20];
int m,n,flag;
void dfs(int x,int count,int sum)///x为判断第x数是否放入,conunt为已经放入多少数,m为和
{
    if(sum>n)
      return;
    if(sum==n)
    {
        flag=1;
        for(int i=0;i<count-1;i++)
            printf("%d+",ans[i]);
        printf("%d\n",ans[count-1]);
    }
    int last=-1;         ///用last来判断前后是否相同
    for(int i=x;i<m;i++)
    {
        if(last!=a[i])
        {
            ans[count]=a[i];
            last=a[i];   ///判重
            dfs(i+1,count+1,sum+a[i]);
        }
    }
    return;
}

int main()
{
    int i;
    while(scanf("%d%d",&n,&m),m||n)
    {
        for(i=0;i<m;i++)
         scanf("%d",&a[i]);
        flag=0;
        printf("Sums of %d:\n",n);
        dfs(0,0,0);
        if(!flag)
        printf("NONE\n");
    }
    return 0;
}

转载于:https://www.cnblogs.com/wangtao971115/p/10358388.html