FZU 2151 OOXX Game

OOXX Game

Problem Description

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

题解代码

#include<cstdio>
char a[120][120];
int main()
{
    int t;
    int n,m;
    scanf("%d",&t);
    int tot = 1;
    while(t--)
    {
        int num = 0;

        scanf("%d%d",&n,&m);
        for(int i = 0;i<n;i++)  
        scanf("%s",a[i]);
        for(int i =  0;i<n;i++)
        {
            for(int j = 0;j<m;j++)
            {
                if(a[i][j]=='O')
                num++;
            }
        }
        if(num%2==0)
        printf("Case %d: Fat brother\n",tot++);
        else
        printf("Case %d: Maze\n",tot++);
    }
    return 0;
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/AcmAres/article/details/79954258
个人分类: ACM
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭