L - OOXX Game

最新推荐文章于 2024-08-23 07:51:22 发布

WA你离我远点

最新推荐文章于 2024-08-23 07:51:22 发布

阅读量6.2k

点赞数

分类专栏：日场比赛

本文链接：https://blog.youkuaiyun.com/qq_41524782/article/details/81204043

版权

日场比赛专栏收录该内容

129 篇文章

订阅专栏

本文介绍了一款特殊的游戏——OOXX游戏，并探讨了在最优策略下，两位玩家Fatbrother和Maze谁将赢得比赛。游戏在一个N*M的棋盘上进行，初始时棋盘上的每个格子为'O'或'X'。玩家轮流选择一个标记为'O'的格子并将其变为'X'。当所有格子都变成'X'时游戏结束。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, there are N*M coins in this board with two symbol “O” or “X”. Then they take turns to choose a grid with symbol “O” and change it into “X”. The game ends when all the symbols in the board are “X”, and the one who cannot play in his (her) turns loses the game. Fat brother and Maze like this kind of OOXX game very much and play it day and night. They don’t even need a little rest after each game!

Here's the problem: Who will win the game if both use the best strategy? You can assume that Maze always goes first.

Input

The first line of the date is an integer T, which is the number of the text cases.

Then T cases follow, each case contains two integers N and M indicate the size of the board. Then goes N line, each line with M character shows the state of the board.

1 <= T <=100, 1 <= n <=100, 1 <= m <=100

Output

For each case, output the case number first, and then output the winner’s name, either Fat brother or Maze. See the sample input and output for more details.

Sample Input

3
1 4
OXXX
2 4
OOXX
OOXX
1 2
XX

Sample Output

Case 1: Maze
Case 2: Fat brother
Case 3: Fat brother

AC代码（输入的时候以串的形式输入（校赛时犯过这样的错误））