1894:Tic-Tac-Toe

时间限制:2 S   /  内存限制:65536 KB
AC:5   /  Submit:47
问题描述

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.

输入描述

First line contains an integer T (1 ≤ T ≤ 104), 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.

输出描述

For each test case:

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

Otherwise output “Cannot win!

样例输入复制样例

3

. . .

. . .

. . .

o

o x o

o . x

x x o

x

o x .

. o .

. . x

o

样例输出

Cannot win!

Kim win!

Kim win!

来源
2017年第八届福建省大学生程序设计竞赛正式赛L

Copyright 2016 - 2024 XUJC ACM Team
闽ICP备2020022076号-1