该博客讨论了Marsha和Bill如何试图公平地分配具有不同价值的弹珠。当每颗弹珠都有1到6的值时，需要找到一种方法使两人获得相同总价值的弹珠。题目转化为检查是否存在一种公平的分割方式。输入描述了一系列弹珠集合，输出应表明是否可以公平分配。解决方案涉及到完全背包问题，并强调需要使用二进制优化来解决。
题意：
Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, because then they could just split the collection in half. But unfortunately, some of the marbles are larger, or more beautiful than others. So, Marsha and Bill start by assigning a value, a natural number between one and six, to each marble. Now they want to divide the marbles so that each of them gets the same total value.
Unfortunately, they realize that it might be impossible to divide the marbles in this way (even if the total value of all marbles is even). For example, if there are one marble of value 1, one of value 3 and two of value 4, then they cannot be split into sets of equal value. So, they ask you to write a program that checks whether there is a fair partition of the marbles.
Input
Each line in the input describ
最低0.47元/天 解锁文章
2300
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
