垂直距离求解

C++ 代码

# include <cstdio>
#include <algorithm>

using namespace std;

// 求四个数的最小值
int findMin(int a, int b, int c, int d) {
    return min({a, b, c, d});  // 使用 C++11 的列表初始化求最小值
}

int main(){
    int N;
    int distance;

    while(scanf("%d", &N), N){
        int M[N][N];
        for (int i=0; i < N; i++){
            for (int j=0; j<N; j++){
                distance = findMin(i, j, N-1-i, N-1-j);
                M[i][j] = distance + 1;
                printf("%d ", M[i][j]);
            }
            printf("\n");
        }
        printf("\n");
    }

    return 0;
}