当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

6092:Rikka with Subset

题目描述
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 $A_1-A_n$ and their sum is $m$. Then for each subset $S$ of $A$, Yuta calculates the sum of $S$.

Now, Yuta has got $2^n$ numbers between $[0,m]$. For each $i \in [0,m]$, he counts the number of $i$s he got as $B_i$.

Yuta shows Rikka the array $B_i$ and he wants Rikka to restore $A_1-A_n$.

It is too difficult for Rikka. Can you help her?  
输入解释
The first line contains a number $t(1 \leq t \leq 70)$, the number of the testcases.

For each testcase, the first line contains two numbers $n,m(1 \leq n \leq 50,1 \leq m \leq 10^4)$.

The second line contains $m+1$ numbers $B_0-B_m(0 \leq B_i \leq 2^n)$.
输出解释
For each testcase, print a single line with $n$ numbers $A_1-A_n$.

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
提示
In the first sample, $A$ is $[1,2]$. $A$ has four subsets $[],[1],[2],[1,2]$ and the sums of each subset are $0,1,2,3$. So $B=[1,1,1,1]$
来自杭电HDUOJ的附加信息
Recommend liuyiding

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-6092

最后修改于 2020-10-25T23:28:18+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/65536K(Java/Others)