80 pts 求调

#include <bits/stdc++.h> 
using namespace std;

const int N = 15;
int dx[] = {-1, 1, -1, 1};
int dy[] = {-1, -1, 1, 1};
int n, m, ans;
char g[N][N];

int main() {
    n = m = 8;
    for (int i = 1; i <= n; i++) {
    	for (int j = 1; j <= m; j++) {
    		cin >> g[i][j];
		}
	}
	for (int i = 1; i <= n; i++) {
    	for (int j = 1; j <= m; j++) {
    		if (g[i][j] == '#') {
    			int f = 0;
    			for (int k = 0; k < 4; k++) {
    				if (g[i + dx[k]][j + dy[k]] == '.') {
    					f = 1;
    					break;
					}
				}
				if (!f) cout << i << " " << j;
			}
		}
	}
    return 0;
}