第八届福建省大学生程序设计竞赛-重现赛 L Tic-Tac-Toe

Problem L Tic-Tac-Toe

Accept: 248    Submit: 552
Time Limit: 1000 mSec    Memory Limit : 262144 KB

Problem Description

Kim likes to play Tic-Tac-Toe.

Given a current state, and now Kim is going to take his next move. Please tell Kim if he can win the game in next 2 moves if both player are clever enough.

Here “next 2 moves” means Kim’s 2 move. (Kim move,opponent move, Kim move, stop).

Game rules:

Tic-tac-toe (also known as noughts and crosses or Xs and Os) is a paper-and-pencil game for two players, X and O, who take turns marking the spaces in a 3×3 grid. The player who succeeds in placing three of their marks in a horizontal, vertical, or diagonal row wins the game.

Input

First line contains an integer T (1 ≤ T ≤ 10), represents there are T test cases.

For each test case: Each test case contains three lines, each line three string(“o” or “x” or “.”)(All lower case letters.)

x means here is a x

o means here is a o

. means here is a blank place.

Next line a string (“o” or “x”) means Kim is (“o” or “x”) and he is going to take his next move.

Output

For each test case:

If Kim can win in 2 steps, output “Kim win!”

Otherwise output “Cannot win!”

Sample Input

3. . .. . .. . .oo x oo . xx x oxo x .. o .. . xo

Sample Output

Cannot win!Kim win!Kim win!

关于井字棋的博弈，给出一张进行到一半的图，问在2步之内能否先下的人赢。
我的方法很简单，给出一张棋盘，我发现如果已放上的棋子数小于等于3，那一定赢不了，如果是8个的情况，那只要放下去然后检测有无连成3个情况就行，关键在于4 5 6 7的情况，
井字棋必胜的情况只有一种，就是下一个子之后存在有2条能够连成3个的机会，那么对方是不能堵2条路的，因此就是必胜了，所以按照这个意思来写就行了。