码迷,mamicode.com
首页 > 其他好文 > 详细

Cracking the Coding Interview 6.2

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

标签:os   ar   sp   res   c   view   rac   ca   

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

标签:os   ar   sp   res   c   view   rac   ca   

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

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!