UVa Problem 10189 Minesweeper (扫雷)
来源:互联网 发布:2016金旗奖网络投票 编辑:程序博客网 时间:2024/04/29 11:48
// Minesweeper (扫雷)// PC/UVa IDs: 110102/10189, Popularity: A, Success rate: high Level: 1// Verdict: Accepted // Submission Date: 2014-03-01// UVa Run Time: 0.012s//// 版权所有(C)2011,邱秋。metaphysis # yeah dot net//// 解题思路很简单,使用字符数组表示给定的地雷图,逐个扫描统计各点周围的地雷总数。在计算地雷总数时,// 用到了一个小技巧,设置边界数组 bounds,将当前的点顺次加上边界数组的值即可得到当前点周围的 8 个// 点,注意不要忘记判断点是否在地雷地图范围内。#include <iostream>#include <cstring>using namespace std;#define MAXSIZE 100inline bool range_checking(int x, int y, int row, int column){ return (0 <= x && x < row) && (0 <= y && y < column);}void display(char matrix[][MAXSIZE], int row, int column){ int bounds[8][2] = { {-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1} }; for (int i = 0; i < row; i++) { for (int j = 0; j < column; j++) { // 如果该位置为地雷则原样输出地雷的符号。 if (matrix[i][j] == '*') cout << "*"; else { // 统计该点周围 8 点的地雷总数。 int mines = 0; for (int k = 0; k < 8; k++) { int m = i + bounds[k][0]; int n = j + bounds[k][1]; if (range_checking(m, n, row, column) && matrix[m][n] == '*') mines++; } cout << mines; } } cout << endl; }}int main(int ac, char *av[]){ char matrix[MAXSIZE][MAXSIZE]; int row, column, field = 0; while ((cin >> row >> column, row && column)) { memset(matrix, 0, sizeof(matrix)); for (int i = 0; i < row; i++) for (int j = 0; j < column; j++) cin >> matrix[i][j]; if (field > 0) cout << endl; field++; cout << "Field #" << field << ":" << endl; display(matrix, row, column); } return 0;}