nokia map和离线地图是免费得吗？# PDA - 掌中宝
s*i
1 楼
Given a n×n checkerboard with checkers on it, one can put a new checker in
an empty square if at least two of it's neighbor are occupied by checker(
here only horizontal and vertical).
注:也就是说只有这样的才可以放一个新的checker上去:
* *
_ => *
* *
或者
* *
_* => **
这里*代表已经有的checker, _代表空格
Apply this rule until no more checker can be placed. If we start with n-1
checkers (注如果是start with n个的话 都放对角线上就可以了都occupy了) is it
possible all of n^2 square be occupied in the end? If not prove your result.
想了半天毫无头绪啊 而且据说最简单的答案只需要一句话就可以了 头痛啊啊
an empty square if at least two of it's neighbor are occupied by checker(
here only horizontal and vertical).
注:也就是说只有这样的才可以放一个新的checker上去:
* *
_ => *
* *
或者
* *
_* => **
这里*代表已经有的checker, _代表空格
Apply this rule until no more checker can be placed. If we start with n-1
checkers (注如果是start with n个的话 都放对角线上就可以了都occupy了) is it
possible all of n^2 square be occupied in the end? If not prove your result.
想了半天毫无头绪啊 而且据说最简单的答案只需要一句话就可以了 头痛啊啊
