히더

출처 : https://www.hackerrank.com/challenges/connected-cell-in-a-grid/problem #include using namespace std; bool visited[10][10];int cnt, dy[] = {0,0,1,-1, 1, 1 , -1, -1}, dx[] = {1,-1,0,0,-1,1,1,-1};inline bool check(int i, int j, int n, int m) { return (i >= 0 && j >= 0 && i < n && j < m) ? true : false; } int dfs(int n, int m, int i, int j, int cnt, vector v) { visited[i][j] = 1; cnt++; for (in..