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 n positive A1−An A1−An and their sum is m m. Then for each subset S S of A A, Yuta calculates the sum of S S.
Now, Yuta has got 2n 2n numbers between [0,m] [0,m]. For each i∈[0,m] i∈[0,m], he counts the number of i is he got as Bi Bi.
Yuta shows Rikka the array Bi Bi and he wants Rikka to restore A1−An A1−An.
It is too difficult for Rikka. Can you help her?
For each testcase, the first line contains two numbers n,m(1≤n≤50,1≤m≤104) n,m(1≤n≤50,1≤m≤104).
The second line contains m+1 m+1 numbers B0−Bm(0≤Bi≤2n) B0−Bm(0≤Bi≤2n).
It is guaranteed that there exists at least one solution. And if there are different solutions, print the lexicographic minimum one.
2 2 3 1 1 1 1 3 3 1 3 3 1
1 2 1 1 1
留个纪念
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
int mm[10005];
int la[10005],ans[55];
long long a[10005];
using namespace std;
int main()
{
int t,n,m;
cin>>t;
while(t--)
{
scanf("%d %d",&n,&m);
for(int i=0;i<=m;i++)
{
scanf("%lld",&a[i]);
}
memset(la,0,sizeof(la));
la[0]=1;
for(int i=1;i<=n;i++)
{
int k=1;
while(a[k]==0)
k++;
ans[i]=k;
for(int j=m;j>=0;j--)
{
if(j+k<=m)
{
la[j+k]+=la[j];
a[j+k]-=la[j];
}
}
}
for(int i=1;i<n;i++)
printf("%d ",ans[i]);
printf("%d\n",ans[n]);
}
return 0;
}