首页 > 其他 > 详细

Cracking the Coding Interview 6.2

时间:2014-08-20 12:01:32      阅读:375      评论:0      收藏:0      [点我收藏+]

There is an 8*8 chess board in which two diagnolly opposite corners have been cut off. You are given 31 dominos, and a single domino can cover exactly two squares. Can you use the 31 dominos to cover the entire board? Prove your answer.

 

不可能,棋盘的格子黑白相间,去掉的对角的颜色是一致的,而每个多米诺骨牌一次盖住1黑1白,因此31个牌盖住31黑和31白,而实际上是30黑32白或者32黑30白,因此不可能

Cracking the Coding Interview 6.2,布布扣,bubuko.com

Cracking the Coding Interview 6.2

原文:http://www.cnblogs.com/johnsblog/p/3924011.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!