HDU6092(83/600)

Problem Description
As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:

Yuta has n positive A1−An and their sum is m. Then for each subset S of A, Yuta calculates the sum of S.

Now, Yuta has got 2n numbers between [0,m]. For each i∈[0,m], he counts the number of is he got as Bi.

Yuta shows Rikka the array Bi and he wants Rikka to restore A1−An.

It is too difficult for Rikka. Can you help her?

Input
The first line contains a number t(1≤t≤70), the number of the testcases.

For each testcase, the first line contains two numbers n,m(1≤n≤50,1≤m≤104).

The second line contains m+1 numbers B0−Bm(0≤Bi≤2n).

Output
For each testcase, print a single line with n numbers A1−An.

It is guaranteed that there exists at least one solution. And if there are different solutions, print the lexicographic minimum one.

Sample Input
2
2 3
1 1 1 1
3 3
1 3 3 1

Sample Output
1 2
1 1 1

这个题就是碰到的所有能碰的都算到答案里去
字典序那句话可以说是废话了
算进答案里的去筛掉不能算进答案里的

但是要从小的去筛掉大的

比赛的时候我妄图用大的筛掉小的结果发现组合数算不出来就gg了

#include<bits/stdc++.h>
using namespace std;
long long bi[10010];
int dan[10010];
int main()
{
    int T,n,m;
    cin>>T;
    while(T--)
    {
        memset(dan,0,sizeof(dan));
        cin>>n>>m;
        for(int a=0;a<=m;a++)scanf("%lld",&bi[a]);
        for(int a=0;a<=m;a++)
        {
            if(dan[0]>=n)break;
            if(a<1)continue;
            if(!bi[a])continue;
            dan[++dan[0]]=a;
            for(int b=a;b<=m;b++)
            {
                bi[b]=bi[b]-bi[b-a];
            }
            a--;
        }
        int jc=0;
        for(int a=1;a<=dan[0];a++)
        {
            if(!jc)
            {
                printf("%d",dan[a]);
                jc=1;
                continue;
            }
            printf(" %d",dan[a]);
        }
        printf("\n");
    }
}