N - Five-In-a-Row

题目：

Alice and Bob play 5-in-a-row game. They have a playing field of size 10 × 10. In turns they put either crosses or noughts, one at a time. Alice puts crosses and Bob puts noughts.

In current match they have made some turns and now it's Alice's turn. She wonders if she can put cross in such empty cell that she wins immediately.

Alice wins if some crosses in the field form line of length not smaller than 5. This line can be horizontal, vertical and diagonal.

Input

You are given matrix 10 × 10 (10 lines of 10 characters each) with capital Latin letters 'X' being a cross, letters 'O' being a nought and '.' being an empty cell. The number of 'X' cells is equal to the number of 'O' cells and there is at least one of each type. There is at least one empty cell.

It is guaranteed that in the current arrangement nobody has still won.

Output

Print 'YES' if it's possible for Alice to win in one turn by putting cross in some empty cell. Otherwise print 'NO'.

Examples

Input

XX.XX.....
.....OOOO.
..........
..........
..........
..........
..........
..........
..........
..........

Output

YES

Input

XXOXX.....
OO.O......
..........
..........
..........
..........
..........
..........
..........
..........

Output

NO

题意：

两个人下五子棋，问你现在让X下一步，X能否赢得比赛；

思路：

这道题就是一道简单的模拟题，我们只需要枚举每一个X能下的位置，然后判断出来同行同列和两条对角线上是否有5个X就可以了，主要是注意一些细节；

代码如下：

#include<stdio.h>
#include<string.h>

char a[11][11];
int bfs(int x,int y)
{
    int sum=0;
    int i,j;
    for(i=x;i>=0;i--)//同行；
    {
        if(a[i][y]=='X')
            sum++;
        else
            break;
    }
    for(i=x+1;i<10;i++)
    {
        if(a[i][y]=='X')
            sum++;
        else
            break;
    }
    if(sum>=5)
        return 1;
    sum=0;
    for(j=y;j>=0;j--)//同列；
    {
        if(a[x][j]=='X')
            sum++;
        else
            break;
    }
    for(j=y+1;j<10;j++)
    {
        if(a[x][j]=='X')
            sum++;
        else
            break;
    }
    if(sum>=5)
        return 1;
    sum=0;
    for(i=x,j=y;i>=0,j>=0;i--,j--)//右上角到左下角的对角线；
    {
        if(a[i][j]=='X')
            sum++;
        else
            break;
    }
    for(i=x+1,j=y+1;i<10,j<10;i++,j++)
    {
        if(a[i][j]=='X')
            sum++;
        else
            break;
    }
    if(sum>=5)
        return 1;
    sum=0;
    for(i=x,j=y;i>=0,j<10;i--,j++)//左上角到右下角的对角线；
    {
        if(a[i][j]=='X')
            sum++;
        else
            break;
    }
    for(i=x+1,j=y-1;i<10,j>=0;i++,j--)//注意x，y的值；
    {
        if(a[i][j]=='X')
            sum++;
        else
            break;
    }
    if(sum>=5)
        return 1;
    return 0;
}

int main()
{
    int i,j,kk,flag=0;
    for(i=0;i<10;i++)
        scanf("%s",a[i]);
    for(i=0;i<10;i++)
    {
        for(j=0;j<10;j++)
        {
            if(a[i][j]=='.')
            {
                a[i][j]='X';
                kk=bfs(i,j);
                if(kk==1)
                {
                    flag=1;
                    printf("YES\n");
                    break;
                }
                else
                a[i][j]='.';//记得还原；
            }
        }
        if(flag==1)
            break;
    }
    if(flag==0)
        printf("NO\n");
    return 0;
}