1160 蛇形矩阵（codevs）

#include<cstdio>
#include<iostream>
using namespace std;
int ans[102][102];
int main()
{
    int n,x,y,sum=0;
    cin>>n;
    x=y=(n+1)/2;
    ans[x][y]=1;
    for (int i=2;i<=n;i++)
      {
          int a,b;
          if (i%2==0) b=y+1;
        else b=y-1;
          ans[x][b]=ans[x][y]+1;
          y=b;
          for (int j=1;j<i;j++)
            {
                if (i%2==0)
                  a=x-j;
                else a=x+j;
                ans[a][y]=ans[x][y]+j;
            }
            x=a;
          for (int j=1;j<i;j++)
            {
                 if (i%2==0)
                    b=y-j;
                 else b=y+j;
                 ans[x][b]=ans[x][y]+j;
            }
          y=b;
      }
    for (int i=1;i<=n;i++)
     {
      for (int j=1;j<=n;j++)
        cout<<ans[i][j]<<‘ ‘;
      cout<<endl;
     }
    for (int i=1;i<=n;i++)
      sum+=(ans[i][i]+ans[i][n+1-i]);
    sum-=1;
    cout<<sum;
    return 0;
}