#include<bits/stdc++.h>
using namespace std;
const int M = 31;
int Map[M][M]; // 記錄輸入格子的情況
bool vis[M][M] = { false }; // 標(biāo)記格子訪問(wèn)情況，默認(rèn)未訪問(wèn)
int n;
queue <int > q;

void bfs(int x, int y) {  //廣度優(yōu)先搜索格子
    int dir[4][2] = { {-1,0},{1,0},{0,-1},{0,1} }; // 上下左右四個(gè)方向
    vis[x][y] = true; //標(biāo)記格子為訪問(wèn)過(guò)
    q.push(x);q.push(y);
    while (!q.empty()) {
        int w = q.front();
        q.pop();
        int e = q.front();
        q.pop();
        for (int i = 0;i < 4;i++) {  //遍歷四個(gè)方向向外擴(kuò)展一圈
            int now_x = w + dir[i][0];
            int now_y = e + dir[i][1];
            //判斷新格子是否合法
            if (1 <= now_x && now_x <= n && 1 <= now_y && now_y <= n && Map[now_x][now_y] == 0 && !vis[now_x][now_y]) {
                vis[now_x][now_y] = true;//標(biāo)記格子為訪問(wèn)過(guò)
                q.push(now_x);q.push(now_y);
            }
        }
    }
}
int main()
{
    cin >> n;
    for (int i = 1;i <= n;i++) {
        for (int j = 1;j <= n;j++) {
            cin >> Map[i][j];
            if (Map[i][j] == 1)
                vis[i][j] = true;
        }
    }
    for (int i = 1;i <= n;i = i + n - 1) {//從邊緣兩行開(kāi)始遍歷
        for (int j = 1; j <= n;j++) {
            if (vis[i][j])
                continue;
            bfs(i, j);
        }
    }

    for (int i = 1;i <= n;i = i + n - 1) {//從邊緣兩列開(kāi)始遍歷
        for (int j = 1;j <= n;j++) {
            if (vis[j][i])
                continue;
            bfs(j, i);
        }
    }

    for (int i = 1;i <= n;i++) {
        for (int j = 1;j <= n;j++) {
            if (vis[i][j])  // 屬于非封閉區(qū)域
                cout << Map[i][j] << " ";
            else
                cout << 2 << " ";
        }
        cout << endl;
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

int n, a, b, k[210];
bool f[210] = { false }; // 標(biāo)記樓層是否訪問(wèn)過(guò)，默認(rèn)沒(méi)有

void bfs() {
    queue<pair<int, int> > q; // 定義隊(duì)列
    pair<int, int> p, t; // <當(dāng)前第幾層，當(dāng)前按了幾次>
    p.first = a; p.second = 0;// 賦初值
    q.push(p);//進(jìn)入隊(duì)列
    while (!q.empty()) {//隊(duì)列非空
        p = q.front(); q.pop();
        if (f[p.first]) // 如果樓層訪問(wèn)過(guò)
            continue;
        f[p.first] = true; // 標(biāo)記樓層訪問(wèn)過(guò)
        if (p.first == b) { // 達(dá)到目標(biāo)樓層
            cout << p.second << endl;
            return;// 退出搜索
        }
        if (p.first - k[p.first] > 0) { // 向下按
            t.first = p.first - k[p.first];
            t.second = p.second + 1;
            q.push(t);
        }
        if (p.first + k[p.first] <= n) { // 向上按
            t.first = p.first + k[p.first];
            t.second = p.second + 1;
            q.push(t);
        }
    }
    cout << -1 << endl;
}

int main() {
    cin >> n >> a >> b;
    for (int i = 1; i <= n; i++)
        cin >> k[i];
    bfs(); //廣度優(yōu)先搜索答案
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int a[35][35] = { 0 };  // 記錄方陣初始情況
int n;
int dir[4][2] = { {1, 0}, {-1, 0}, {0, 1}, {0, -1} }; // 上下左右四個(gè)方向
int cnt = 0; //記錄某一封閉區(qū)域的面積
int cnt_max = 0; // 記錄最大封閉區(qū)域的面積
int id = 3; // 搜索標(biāo)記
int id_max = id; // 最大封閉區(qū)域?qū)?yīng)的搜索標(biāo)記
void prit() {  // 格式化輸出函數(shù)
	int i, j;
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= n; j++) {
			if (a[i][j] == 1) {
				cout << a[i][j] << ' ';
			}
			else if (a[i][j] != id_max) {
				cout << '0' << ' ';
			}
			else {
				cout << '2' << ' ';
			}
		}
		cout << endl;
	}
}

void dfs(int x, int y)//將與其鄰接的0坐標(biāo)改為id
{
	int i;

	if (a[x][y] != 0 || x < 0 || x > n + 1 || y < 0 || y > n + 1) { //檢查是否符合條件
		return;
	}

	a[x][y] = id;
	cnt++;

	for (i = 0; i < 4; i++) { // 搜索四個(gè)方向
		dfs(x + dir[i][0], y + dir[i][1]);
	}
}
int main() {
	int i, j;
	cin >> n;

	for (i = 1; i <= n; i++) { //輸入方陣
		for (j = 1; j <= n; j++) {
			cin >> a[i][j];
		}
	}
	//最外圍的0不形成封閉區(qū)域
	dfs(0, 0);
	id++;
	for (i = 2; i < n; i++) {//從第二層開(kāi)始形成封閉區(qū)域
		for (j = 2; j < n; j++) {
			cnt = 0;
			dfs(i, j);
			if (cnt > cnt_max) { // 判斷是否為最大封閉區(qū)域
				cnt_max = cnt;
				id_max = id;
			}
			id++; // 搜索標(biāo)記+1
		}
	}
	prit();
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int Map[21][21] = { 0 }; // 記錄區(qū)域可通行情況
int m, n;
queue <int > q; 
int num = 1; // 記錄當(dāng)前是第幾輪搜索
void bfs(int x, int y, int ex, int ey) {
	int dir[4][2] = { {-1,0},{1,0},{0,-1},{0,1} }; // 上下左右四個(gè)方向
	q.push(x);q.push(y);
	while (!q.empty()) {
		int s = q.size() / 2; // 當(dāng)前搜索輪次有幾個(gè)點(diǎn)
		for (int k = 0;k < s;k++) {
			int cur_x = q.front();
			q.pop();
			int cur_y = q.front();
			q.pop();
			for (int i = 0;i < 4;i++) { // 遍歷搜索四個(gè)方向
				int now_x = cur_x + dir[i][0];
				int now_y = cur_y + dir[i][1];
				if (now_x == ex && now_y == ey)  // 判斷是否到終點(diǎn)
					return;

				if (0 <= now_x && now_x < n && 0 <= now_y && now_y < m && Map[now_x][now_y] == 0) { // 判斷當(dāng)前點(diǎn)是否符合條件
					q.push(now_x);q.push(now_y);
					Map[now_x][now_y] = num; // 標(biāo)記當(dāng)前點(diǎn)的搜索輪次
				}
			}
		}
		num++;
	}
}
int sx, sy, ex, ey;   // 起點(diǎn)終點(diǎn)坐標(biāo)
int main() {
	cin >> m >> n;
	cin >> sx >> sy >> ex >> ey;
	for (int i = 0;i < m;i++)
		for (int j = 0;j < n;j++)
			cin >> Map[i][j];
	bfs(sx, sy, ex, ey);//調(diào)用bfs函數(shù)求解
	for (int i = 0;i < m;i++) {
		for (int j = 0;j < n;j++) {
			if (i == sx && j == sy) // 起點(diǎn)
				cout << "  a";
			else if (i == ex && j == ey) //終點(diǎn)
				cout << "  b";
			else if (Map[i][j] == num) //與b同層的點(diǎn)
				cout << "  0";
			else {// 其余點(diǎn)
				if (Map[i][j] < num) 
					printf("%3d", Map[i][j]);
			}

			//cout << "(" << i << "," << j << ")" << endl;
		}
		cout << endl;
	}
	return 0;
}