当前位置 : 主页 > 网络编程 > 其它编程 >

CrackingtheCodingInterview6.2

来源:互联网 收集:自由互联 发布时间:2023-07-02
Thereisan8*8chessboardinwhichtwodiagnollyoppositecornershavebeencutoff.Youaregiven31domino 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
Thereisan8*8chessboardinwhichtwodiagnollyoppositecornershavebeencutoff.Youaregiven31domino

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,,

Cracking the Coding Interview 6.2

【文章原创作者:日本多ip站群服务器 http://www.558idc.com/japzq.html欢迎留下您的宝贵建议】
网友评论