箱子归位

#include <iostream>

using namespace std;

int main()
{
    const int CENTER_COL = 2; // 中心位置行索引
    const int CENTER_ROW = 2; // 中心位置列索引
    const int ROW = 5;
    const int COL = 5;
    int num;
    int cur_col = 0;
    int cur_row = 0;
    for (int col = 0; col < COL; col++) {
        for (int row = 0; row < ROW; row++) {
            cin >> num;
            if (num == 1) {
                cur_col = col;
                cur_row = row;
            }
        }
    }
    int step = abs(CENTER_COL - cur_col) + abs(CENTER_ROW - cur_row);
    cout << step;
    return 0;
}