Codeforces Round #228 (Div. 2) B. Fox and Cross

Fox Ciel has a board with n rows and n columns. So, the board consists of n × n cells. Each cell contains either a symbol '.', or a symbol '#'.

A cross on the board is a connected set of exactly five cells of the board that looks like a cross. The picture below shows how it looks.

Ciel wants to draw several (may be zero) crosses on the board. Each cross must cover exactly five cells with symbols '#', and any cell with symbol '#' must belong to some cross. No two crosses can share a cell.

Please, tell Ciel if she can draw the crosses in the described way.

Input

The first line contains an integer n (3 ≤ n ≤ 100) — the size of the board.

Each of the next n lines describes one row of the board. The i-th line describes the i-th row of the board and consists of n characters. Each character is either a symbol '.', or a symbol '#'.

Output

Output a single line with "YES" if Ciel can draw the crosses in the described way. Otherwise output a single line with "NO".

检查一副图中的#是否可以完全由十字组成，从上到下检索即可

#include <cstdio>
#include <cstring>

#define max 110

int main()
{
    int n;
    bool flag=0;
    char map[max][max];
    scanf("%d",&n);
    getchar();
    memset(map,'.',sizeof(map));
    for(int i=2;i<n+2;++i)
    {
        for(int j=2;j<n+2;++j)
            scanf("%c",&map[i][j]);
        getchar();
    }
    for(int i=2;i<n+2;++i)
    {
        for(int j=2;j<n+2;++j)
        {
            if(map[i][j]=='#')
            {
                flag=0;
                if(map[i+1][j-1]=='#'&&map[i+1][j]=='#'&&map[i+1][j+1]=='#'&&map[i+2][j]=='#')
                {
                    flag=1;
                    map[i][j]=map[i+1][j-1]=map[i+1][j]=map[i+1][j+1]=map[i+2][j]='.';
                }
                else
                {
                    puts("NO");
                    return 0;
                }
            }
        }
    }
    puts("YES");
    return 0;
}