[Programming Challenge #2] 지뢰찾기

코드가 더럽다...

#include <iostream> using namespace std; int direction[8][2] = { {-1, 0}, {1, 0}, {0, -1}, {0, 1}, {-1, -1}, {1, 1}, {-1, 1}, {1, -1} }; int main() { int x, y; char c; int* miner; int cnt = 1; while(cin >> x >> y) { if(x == y && x == 0) break; miner = new int[x * y]; for(int i=0; i { for(int j=0; j { cin >> c; if(c == '*') { miner[j + i*y] = -1; } else { miner[j + i*y] = 0; } } } for(int i=0; i { for(int j=0; j { if(miner[j + i*y] == -1) { for(int k=0; k<8; k++) { if(i + direction[k][0] >= 0 && i + direction[k][0] < x && j + direction[k][1] >= 0 && j + direction[k][1] < y && miner[j + direction[k][1] + (i + direction[k][0])*y] != -1) { miner[j + direction[k][1] + (i + direction[k][0])*y]++; } } } } } if(cnt != 1) cout << endl; cout << "Field #" << cnt << ":" << endl; for(int i=0; i { for(int j=0; j { if(miner[j + i*y] == -1) cout << '*'; else cout << miner[j + i*y]; } cout << endl; } cnt++; } }