题解 | #箱子归位#
箱子归位
https://ac.nowcoder.com/acm/problem/22212
#include <bits/stdc++.h> using namespace std;
int main() { int a[6][6]; int x,y; for(int i=1;i<=5;i++) for(int j=1;j<=5;j++) { cin >> a[i][j]; if(a[i][j]==1){ x=i; y=j; } } int count=0; while(x!=3){ if(x>3){ x--; count++; } else{ x++; count++; } } while(y!=3){ if(y>3){ y--; count++; } else{ y++; count++; } } cout << count; }
