Codeforces Round #483 (Div. 2) B. Minesweeper

题目地址：http://codeforces.com/contest/984/problem/B

题目大意：扫雷游戏，给你一个n*m的地图，如果有炸弹，旁边的八个位置都会+1，问这幅图是不是正确的。

题解：把输入的地图转换为数字格式，自己重新按炸弹绘制一幅图，对比一下。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<stack>
using namespace std;
const int inf = 0x3f3f3f3f;
int main()
{
    int n, m;
    int map[][], co[][] = {};
    scanf("%d%d", &n, &m);
    for (int i = ; i < n; i++)
    {
        getchar();
        for (int j = ; j < m; j++)
        {
            char cell;
            scanf("%c", &cell);
            if (cell == '*')
            {
                map[i][j] = ;
                co[i][j] = ;
                co[i - ][j - ]++; co[i - ][j]++; co[i - ][j + ]++;
                co[i][j - ]++; co[i][j + ]++;
                co[i + ][j - ]++; co[i + ][j]++; co[i + ][j + ]++;
            }
            else if (cell == '.')
                map[i][j] = ;
            else
                map[i][j] = cell - '';
        }
    }
    int flag = ;
    for (int i = ; i < n; i++)
    {
        for (int j = ; j < m; j++)
        {
            if (map[i][j] != co[i][j]&&co[i][j]<=)
            {
                flag = ;
                goto x;
            }
        }
    }
x:
    if (flag == )
        printf("NO\n");
    else
        printf("YES\n");
    return ;
}