提示: 欢迎访问OurACM平台。
Problem 2283 Tic-Tac-Toe

Accept: 216    Submit: 465
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 . . . . . . . . . o o x o o . x x x o x o x . . o . . . x o

Sample Output

Cannot win! Kim win! Kim win!

Source

第八届福建省大学生程序设计竞赛-重现赛(感谢承办方厦门理工学院)

Submit  Back  Status  Discuss