FZU2283+Tic-Tac-Toe+【思维+暴力枚举】+ 第八届福建省大学生程序设计竞赛

Problem 2283 Tic-Tac-Toe

Accept: 35    Submit: 46
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. . .. . .. . .oo x oo . xx x oxo x .. o .. . xo

 Sample Output

Cannot win!

Kim win!

Kim win!

题意

给你一个3*3的井字棋，判断Kim是否能够通过两步赢得对手。

两步赢得对手的步骤是：Kim下，对方下，Kim下。

如果棋子能够三连就算Kim赢。

思路

①首先我们暴力枚举一个位子，使得这个位子就是Kim下的位子。

②然后judge1一下是否能够胜利。

③然后我们不枚举对方的走法，因为对方要足够聪明，所以我们枚举Kim下一步走哪里会赢，如果有这样一个位子，对手肯定要阻拦。

那么怎样的条件对方阻拦不了Kim的胜利呢？就是Kim下一步，如果有两个位子以上的放置方案会赢，那么对手如何阻拦都不行了，judge一下下。

④过程模拟一下即可。

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
char s[10][10];
char a[10];
int judge1(int x,int y,char bb)//放置一个点，看这个点能否满足
{
    int flag;
    for(int i=0; i<3; i++)
    {
        if(s[i][y]==bb)
        {
            flag=0;
        }
        else
        {
            flag=1;
            break;
        }
    }
    if(flag==0)
        return flag;
    for(int i=0; i<3; i++)
    {
        if(s[x][i]==bb)
        {
            flag=0;
        }
        else
        {
            flag=1;
            break;
        }
    }
    if(flag==0)
        return flag;
    if(x==y)
    {
        for(int i=0; i<3; i++)
        {
            if(s[i][i]==bb)
            {
                flag=0;
            }
            else
            {
                flag=1;
                break;
            }
        }
    }
    if(flag==0)
        return flag;
    if(x+y==2)
    {
        for(int i=0; i<2; i++)
        {
            if(s[i][2-i]==bb)
            {
                flag=0;
            }
            else
            {
                flag=1;
                break;
            }
        }
    }
    return flag;
}
int judge(char aa) //对全图进行判断
{
    int flaga;
    for(int i=0; i<3; i++)
    {
        for(int j=0; j<3; j++)
        {
            if(s[i][j]==aa)
            {
                flaga=judge1(i,j,aa);
                if(flaga==0)
                {
                    return 1;
                }
            }
        }
    }
    return 0;
}
int main()
{
    int t;
    int aaflag,aflag,sum;
    scanf("%d",&t);
    while(t--)
    {
        aaflag=0;
        for(int i=0; i<3; i++)
        {
            for(int j=0; j<3; j++)
            {
                scanf("%s",a);
                s[i][j]=a[0];
            }
        }
        scanf("%s",a);
        for(int i=0; i<3; i++)
        {
            if(aaflag==1)
                break;
            for(int j=0; j<3; j++)
            {
                if(s[i][j]=='.')
                {
                    s[i][j]=a[0];//放置第一个点
                    aflag=judge1(i,j,a[0]);
                    if(aflag==0)
                    {
                        aaflag=1;
                        break;
                    }
                    for(int i=0; i<3; i++)
                    {
                        if(aaflag==1)
                            break;
                        for(int j=0; j<3; j++)
                        {
                            if(s[i][j]=='.')
                            {
                                s[i][j]==a[0];
                                aflag=judge1(i,j,a[0]);
                                sum=0;
                                if(aflag==0)//找到满足条件第一种方案
                                {
                                    sum++;
                                    if(a[0]=='o')
                                        s[i][j]='s';
                                    else
                                        s[i][j]='0';
                                    aflag=judge(a[0]);
                                    if(aflag==1)//找到第二个方案
                                    {
                                        sum++;
                                        if(sum>=2)
                                        {
                                            aaflag=1;
                                            break;
                                        }
                                    }
                                }
                                s[i][j]='.';
                            }
                        }
                    }
                    s[i][j]='.';
                }
            }
        }
        if(aaflag==1)
            printf("Kim win!\n");
        else
            printf("Cannot win!\n");
    }
}