UVA 10189: Minesweeper

以下是问题的链接：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&项目ID=8&category=13&page=show_problem&问题=1130

这是我的代码，它工作得很完美；然而，每当我提交它时，它都会给出错误的答案。有人知道为什么吗？

注意：我在矩阵中增加了2行和2列，这样当我检查第一列的左侧或最后一行的底部时，就不会出现错误。

//A minesweeper generator
#include <iostream>
#include <sstream>
using namespace std;
char arr[102][102]; //2D dynamic array used temporarily
int main() {
    int n, m; //Rows and columns
    int count = 0, recordNum = 0; //Number of mines around the current dot
    while(true) { //Keep processing records until "0 0" is encountered
        cin >> n >> m;
        if(n == 0 && m == 0 ) //End of input
            break;
        //Read the values into the array
        for(int i = 1; i < n+1; i++) { //Rows
            for(int j = 1; j < m+1; j++) { //Columns
                cin >> arr[i][j];
            }
        }
        //Process the values of the array and generate the numbers
        for(int i = 1; i < n+1; i++) { //Rows
            for(int j = 1; j < m+1; j++) { //Columns
                if(arr[i][j] == '*')
                    continue;
                else { //Count the number of mines around this dot
                    if(arr[i-1][j-1] == '*')
                                        count++;
                                    if(arr[i-1][j] == '*')
                                        count++;
                                    if(arr[i-1][j+1] == '*')
                        count++;
                    if(arr[i][j-1] == '*')
                                        count++;
                                    if(arr[i][j+1] == '*')
                                        count++;
                                    if(arr[i+1][j-1] == '*')
                        count++;
                    if(arr[i+1][j] == '*')
                                        count++;
                                    if(arr[i+1][j+1] == '*')
                        count++;
                }
                //Create a buffer to convert the count to a char
                stringstream buffer;
                buffer << count;
                arr[i][j] = buffer.str().at(0);
                count = 0; //Finally reset the counter
            }
        }
        if(recordNum > 0)
            cout << endl;
        recordNum++;
        cout << "Field #" << recordNum << ":n";
        //Output the values
        for(int i = 1; i < n+1; i++) { //Rows
            for(int j = 1; j < m+1; j++) { //Columns
                cout << arr[i][j];
            }
            cout << endl;
        }
    }
    return 0;
}