CF3C 暴力

http://codeforces.com/problemset/problem/3/C

C. Tic-tac-toe

time limit per test

1 second

memory limit per test

64 megabytes

input

standard input

output

standard output

Certainly, everyone is familiar with tic-tac-toe game. The rules are very simple indeed. Two players take turns marking the cells in a3 × 3 grid (one player always draws crosses, the other — noughts). The player who succeeds first in placing three of his marks in a horizontal, vertical or diagonal line wins, and the game is finished. The player who draws crosses goes first. If the grid is filled, but neither Xs, nor 0s form the required line, a draw is announced.

You are given a 3 × 3 grid, each grid cell is empty, or occupied by a cross or a nought. You have to find the player (first or second), whose turn is next, or print one of the verdicts below:

• illegal — if the given board layout can't appear during a valid game;
• the first player won — if in the given board layout the first player has just won;
• the second player won — if in the given board layout the second player has just won;
• draw — if the given board layout has just let to a draw.

Input

The input consists of three lines, each of the lines contains characters ".", "X" or "0" (a period, a capital letter X, or a digit zero).

Output

Print one of the six verdicts: first, second, illegal, the first player won, the second player won or draw.

Sample test(s)

input

X0X
.0.
.X.

output

second

/**
CF3C 暴力
题目大意：给定一个3*3的棋盘，判断现在的情况下是属于什么状态（状态有6种）
解题思路：判断非法的时候要注意如果已经出现赢的情况了，棋盘就必须结束。其余就是简单暴力
*/
#include <string.h>
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
char a[5][5];
int cnt0,cntx;
bool win(char x)
{
    if(a[0][0]==x&&a[0][1]==x&&a[0][2]==x)return true;
    if(a[1][0]==x&&a[1][1]==x&&a[1][2]==x)return true;
    if(a[2][0]==x&&a[2][1]==x&&a[2][2]==x)return true;
    if(a[0][0]==x&&a[1][0]==x&&a[2][0]==x)return true;
    if(a[0][1]==x&&a[1][1]==x&&a[2][1]==x)return true;
    if(a[0][2]==x&&a[1][2]==x&&a[2][2]==x)return true;
    if(a[2][0]==x&&a[1][1]==x&&a[0][2]==x)return true;
    if(a[0][0]==x&&a[1][1]==x&&a[2][2]==x)return true;
    return false;
}
bool judge()
{
    if(win('X')&&cntx==cnt0)return true;
    if(win('0')&&cntx==cnt0+1)return true;
    if(cntx>cnt0+1||cntx<cnt0)return true;
    return false;
}
int main()
{
    for(int i=0;i<3;i++)
    {
        scanf("%s",a[i]);
    }
    cnt0=0,cntx=0;
    for(int i=0;i<3;i++)
    {
        for(int j=0;j<3;j++)
        {
            if(a[i][j]=='0')
            {
                cnt0++;
            }
            if(a[i][j]=='X')
            {
                cntx++;
            }
        }
    }
    if(judge())
    {
        printf("illegal\n");
    }
    else if(win('0'))
    {
        printf("the second player won\n");
    }
    else if(win('X'))
    {
        printf("the first player won\n");
    }
    else if(cnt0+cntx==9)
    {
        printf("draw\n");
    }
    else if(cnt0==cntx)
    {
       printf("first\n");
    }
    else
    {
       printf("second\n");
    }
    return 0;
}
/**
X0.
...
...

X0X
0X0
0X0

XXX
XXX
XXX

000
X..
...

0X.
X0.
...

X0X
0X0
X0X
*/