天梯 蛇形矩阵

#include <iostream>

using namespace std;

int arr[100][100];

int main()
{
    int n,num=2;
    cin >> n;
    int d=n/2,f=n/2;
    arr[f][d]=1;
    d++;
    for(int i=2; i <= n-1 ; i+=2){
      int k=i;
      while(k>0){
        arr[f][d]=num;
        num++;
        if(k!=1) f--;
        else d--;
        k--;
      }
      k=i;
      while(k>0){
        arr[f][d]=num;
        num++;
        if(k!=1) d--;
        else f++;
        k--;
      }
      k=i;
      while(k>0){
        arr[f][d]=num;
        num++;
        if(k!=1) f++;
        else d++;
        k--;
      }
      k=i;
      while(k>0){
        arr[f][d]=num;
        num++;
        if(k!=1) d++;
        k--;
      }
      d++;
    }
    for(int i=0; i < n; ++i){
      for(int j=0; j < n; ++j){
        if(j==0) cout << arr[i][j];
        else cout << " " << arr[i][j];
      }
      cout << endl;
    }
    int sum=0;
	for(int i=0; i < n; ++i)
		sum+=arr[i][i];
	for(int i=0,j=n-1; i < n; i++,j--)
		sum+=arr[i][j];
	cout << sum-1 << endl;  
}