문제https://www.acmicpc.net/problem/1189 해설백트래킹을 이용한 간단한 탐색 문제코드123456789101112131415161718192021222324252627282930313233343536373839404142434445#include iostream>#include algorithm>using namespace std; int r, c, k, visited[7][7], ret;char mp[7][7];int dx[4] = {0, 1, 0, -1};int dy[4] = {-1, 0, 1, 0}; void dfs(int y, int x, int cnt){ if (cnt == k) { if (y == 0 && x == c - 1) { ret++; ..