摘要：
A.ChessProblem DescriptionWe have a chessboard, as the figure below, it shows the chessboard with dimension 1, 3, 5, 7 (We ignore the even number).Now, your task is to place K bishops on the n – dimension chessboard and satisfied that none of then attack each other ( A bishop can move to any distan. 阅读全文
posted @ 2012-08-18 11:29 皇星客栈--Linux 阅读(257) 评论(0) 推荐(0) 编辑