以文本方式查看主题

-  计算机科学论坛  (http://bbs.xml.org.cn/index.asp)
--  『 算法理论与分析 』  (http://bbs.xml.org.cn/list.asp?boardid=60)
----  有道证明题,高人请进来帮忙  (http://bbs.xml.org.cn/dispbbs.asp?boardid=60&rootid=&id=26845)


--  作者:johnhash
--  发布时间:1/31/2006 1:45:00 AM

--  有道证明题,高人请进来帮忙
Here is a puzzle. You are given 10 boxes, each large enough to contain exactly ten wooden cubes. You are also given 100 wooden cubes-in ten different colours. There might not be the same number of cubes in each colour, so you might not be able to pack the cubes in the boxes so that each contains only one colour of block. Show that it is possible to pack the cubes in the boxes so that each box contains cubes of at most two colours.
--  作者:shellkk
--  发布时间:2/24/2006 3:02:00 PM

--  
easy
设颜色a的球个数为n(a)
若任意a,n(a)=10,显然得证;
否则,必存在颜色a,n(a)<10,颜色b,n(b)>10,将n(a)个a色球和10-n(a)个b色球放入第一个箱子。
于是剩下90个球,9个箱子,9种颜色,依此递推即得
W 3 C h i n a ( since 2003 ) 旗 下 站 点
苏ICP备05006046号《全国人大常委会关于维护互联网安全的决定》《计算机信息网络国际联网安全保护管理办法》
31.250ms