헌내기는 친구가 필요해

코드#include #include #include #include using namespace std;const int dx[] = { 1,-1,0,0 };const int dy[] = { 0,0,1,-1 };int n, m, visited[603][603],res;char a[603][603];string s;pair doyeon;int main() { cin >> n >> m; for (int i = 0; i > s; for (int j = 0; j > q; visited[doyeon.first][doyeon.second] = 1; q.push(make_pair(doyeon.first, doyeon.second)); while (!q.empty()) { int px = q.front().firs..

코드 import sys # dfs 함수 def dfs(x, y, graph, visited): global count if 0