1c:I[83391,["/_next/static/chunks/01ctw1akxhipf.js","/_next/static/chunks/0es-u.8d.mnrl.js","/_next/static/chunks/0dy1a2.mvnkkn.js","/_next/static/chunks/1490m.ueos6wm.js","/_next/static/chunks/0e0r8s6q6rqo3.js","/_next/static/chunks/06ql-volcxfrm.js"],"ProblemWorkspace",1] 20:I[27201,["/_next/static/chunks/01xlw8hd842-c.js","/_next/static/chunks/0-mla.nmfqw.d.js"],"IconMark"] 1d:T413,#include using namespace std; int n, m; int a[6][6]; bool vizitat[6][6]; int si, sj, fi, fj; vector> drum; int dx[4] = {-1, 1, 0, 0}; int dy[4] = {0, 0, -1, 1}; void afiseaza() { for (size_t k = 0; k < drum.size(); k++) { cout << drum[k].first << "," << drum[k].second; if (k + 1 < drum.size()) cout << " "; } cout << "\n"; } void bkt(int i, int j) { if (i == fi && j == fj) { afiseaza(); return; } for (int d = 0; d < 4; d++) { int ni = i + dx[d], nj = j + dy[d]; if (ni < 1 || ni > n || nj < 1 || nj > m) continue; if (a[ni][nj] == 1 || vizitat[ni][nj]) continue; vizitat[ni][nj] = true; drum.push_back({ni, nj}); bkt(ni, nj); drum.pop_back(); vizitat[ni][nj] = false; } } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> a[i][j]; cin >> si >> sj >> fi >> fj; vizitat[si][sj] = true; drum.push_back({si, sj}); bkt(si, sj); return 0; } 1e:T413,#include using namespace std; int n, m; int a[6][6]; bool vizitat[6][6]; int si, sj, fi, fj; vector> drum; int dx[4] = {-1, 1, 0, 0}; int dy[4] = {0, 0, -1, 1}; void afiseaza() { for (size_t k = 0; k < drum.size(); k++) { cout << drum[k].first << "," << drum[k].second; if (k + 1 < drum.size()) cout << " "; } cout << "\n"; } void bkt(int i, int j) { if (i == fi && j == fj) { afiseaza(); return; } for (int d = 0; d < 4; d++) { int ni = i + dx[d], nj = j + dy[d]; if (ni < 1 || ni > n || nj < 1 || nj > m) continue; if (a[ni][nj] == 1 || vizitat[ni][nj]) continue; vizitat[ni][nj] = true; drum.push_back({ni, nj}); bkt(ni, nj); drum.pop_back(); vizitat[ni][nj] = false; } } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> a[i][j]; cin >> si >> sj >> fi >> fj; vizitat[si][sj] = true; drum.push_back({si, sj}); bkt(si, sj); return 0; } 1f:T464,import sys sys.setrecursionlimit(10000) dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] def bkt(i, j, n, m, a, vizitat, fi, fj, drum, out): if i == fi and j == fj: out.append(' '.join(f"{p[0]},{p[1]}" for p in drum)) return for d in range(4): ni, nj = i + dx[d], j + dy[d] if ni < 1 or ni > n or nj < 1 or nj > m: continue if a[ni][nj] == 1 or vizitat[ni][nj]: continue vizitat[ni][nj] = True drum.append((ni, nj)) bkt(ni, nj, n, m, a, vizitat, fi, fj, drum, out) drum.pop() vizitat[ni][nj] = False data = sys.stdin.read().split() idx = 0 n = int(data[idx]); idx += 1 m = int(data[idx]); idx += 1 a = [[0] * (m + 1) for _ in range(n + 1)] for i in range(1, n + 1): for j in range(1, m + 1): a[i][j] = int(data[idx]); idx += 1 si = int(data[idx]); idx += 1 sj = int(data[idx]); idx += 1 fi = int(data[idx]); idx += 1 fj = int(data[idx]); idx += 1 vizitat = [[False] * (m + 1) for _ in range(n + 1)] vizitat[si][sj] = True out = [] bkt(si, sj, n, m, a, vizitat, fi, fj, [(si, sj)], out) print('\n'.join(out))