C++ 알고리즘 - 백준 1012 유기농 배추
https://www.acmicpc.net/problem/1012 #include #define endl "\n"using namespace std;int farm[52][52];int cnt;void find(int x, int y) { if (farm[x + 1][y] == 1) { farm[x + 1][y] = -1; find(x + 1, y); } if (farm[x][y + 1] == 1) { farm[x][y+1] = -1; find(x, y + 1); } if (x > 0) { if (farm[x - 1][y] == 1) { farm[x - 1][y] = -1; find(x - 1, y); } } if (y > 0) { if (farm[x][y - 1] == 1){ f..