1a: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] 1e:I[27201,["/_next/static/chunks/01xlw8hd842-c.js","/_next/static/chunks/0-mla.nmfqw.d.js"],"IconMark"] 1b:T480,#include using namespace std; int n, m; char grila[11][11]; bool vizitat[11][11]; string cuvant; int dx[4] = {-1, 1, 0, 0}; int dy[4] = {0, 0, -1, 1}; bool bkt(int x, int y, int poz) { if (poz == (int)cuvant.size()) return true; for (int d = 0; d < 4; d++) { int nx = x + dx[d], ny = y + dy[d]; if (nx >= 1 && nx <= n && ny >= 1 && ny <= m && !vizitat[nx][ny] && grila[nx][ny] == cuvant[poz]) { vizitat[nx][ny] = true; if (bkt(nx, ny, poz + 1)) return true; vizitat[nx][ny] = false; } } return false; } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { string r; cin >> r; for (int j = 1; j <= m; j++) grila[i][j] = r[j - 1]; } cin >> cuvant; bool gasit = false; for (int i = 1; i <= n && !gasit; i++) { for (int j = 1; j <= m && !gasit; j++) { if (grila[i][j] == cuvant[0]) { vizitat[i][j] = true; if (bkt(i, j, 1)) gasit = true; vizitat[i][j] = false; } } } cout << (gasit ? "DA" : "NU") << "\n"; return 0; } 1c:T480,#include using namespace std; int n, m; char grila[11][11]; bool vizitat[11][11]; string cuvant; int dx[4] = {-1, 1, 0, 0}; int dy[4] = {0, 0, -1, 1}; bool bkt(int x, int y, int poz) { if (poz == (int)cuvant.size()) return true; for (int d = 0; d < 4; d++) { int nx = x + dx[d], ny = y + dy[d]; if (nx >= 1 && nx <= n && ny >= 1 && ny <= m && !vizitat[nx][ny] && grila[nx][ny] == cuvant[poz]) { vizitat[nx][ny] = true; if (bkt(nx, ny, poz + 1)) return true; vizitat[nx][ny] = false; } } return false; } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { string r; cin >> r; for (int j = 1; j <= m; j++) grila[i][j] = r[j - 1]; } cin >> cuvant; bool gasit = false; for (int i = 1; i <= n && !gasit; i++) { for (int j = 1; j <= m && !gasit; j++) { if (grila[i][j] == cuvant[0]) { vizitat[i][j] = true; if (bkt(i, j, 1)) gasit = true; vizitat[i][j] = false; } } } cout << (gasit ? "DA" : "NU") << "\n"; return 0; } 1d:T4b9,import sys sys.setrecursionlimit(10000) dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] def bkt(x, y, poz, n, m, grila, vizitat, cuvant): if poz == len(cuvant): return True for d in range(4): nx, ny = x + dx[d], y + dy[d] if 1 <= nx <= n and 1 <= ny <= m and not vizitat[nx][ny] and grila[nx][ny] == cuvant[poz]: vizitat[nx][ny] = True if bkt(nx, ny, poz + 1, n, m, grila, vizitat, cuvant): return True vizitat[nx][ny] = False return False data = sys.stdin.read().split() idx = 0 n = int(data[idx]); idx += 1 m = int(data[idx]); idx += 1 grila = [[''] * (m + 1) for _ in range(n + 1)] for i in range(1, n + 1): r = data[idx]; idx += 1 for j in range(1, m + 1): grila[i][j] = r[j - 1] cuvant = data[idx] vizitat = [[False] * (m + 1) for _ in range(n + 1)] gasit = False for i in range(1, n + 1): if gasit: break for j in range(1, m + 1): if gasit: break if grila[i][j] == cuvant[0]: vizitat[i][j] = True if bkt(i, j, 1, n, m, grila, vizitat, cuvant): gasit = True vizitat[i][j] = False print("DA" if gasit else "NU")