코드 #include using namespace std; int n,m,k,visited[10][10],res; int dx[] = {-1,0,1,0}; int dy[] = {0,1,0,-1}; char a[10][10]; string s; void go(int x, int y, int cnt) { if (cnt == k) { if (x==0 && y == m-1) res++; return; } for(int i = 0; i = n || ny >= m || nx < 0 || ny < 0 || visited[nx][ny] || a[nx][ny] == 'T') continue; visited[nx][n..
