uva 10189 扫雷

简单的输入 判断周围上下左右组合的八个方向的雷 然后输出

代码

#include <iostream>
#include <memory.h>

using namespace std;

int n, m;

const int N = ;

char mine[N][N];

int addx[] = { ,-,,-,,-,, };
int addy[] = { ,-,-,,,,,- };

char GetMineCount(int x, int y)
{
    char ret;

    if (mine[x][y] == '*')
        return '*';

    int count = ;
    for (int i = ; i < ; i++) {
        int newx = x + addx[i];
        int newy = y + addy[i];

        if (newx >=  && newx < n && newy >=  && newy < m && mine[newx][newy] == '*')
            count++;
    }

    ret = '' + count;
    return ret;
}

int main()
{
    int idx = ;
    while () {
        cin >> n >> m;
        if (n ==  || m == ) return ;
        memset(mine, , N*N);
        for (int i = ; i < n; i++) {
            for (int j = ; j < m; j++) {
                cin >> mine[i][j];
            }
        }
        if(idx > ) cout << endl;

        cout << "Field #" << ++idx << ":" << endl;

        for (int x = ; x < n; x++) {
            for (int y = ; y < m; y++) {
                mine[x][y] = GetMineCount(x, y);
                cout << mine[x][y];
            }
            cout << endl;
        }
    }

    return ;
}