“CodeVS/1160”的版本间的差异

#include<cstdio>
int main(){
  int n,u[200][200],x,y,i,j,t,s=0;
  scanf("%d",&n);
  for(i=n/2+1,t=1;i<=n;++i,t+=2){
    u[i][i]=t*t;
    x=y=i;
    while(y>i-t+1)
      --y,u[x][y]=u[x][y+1]-1;
    while(x>i-t+1)
      --x,u[x][y]=u[x+1][y]-1;
    while(y<i)
      ++y,u[x][y]=u[x][y-1]-1;
    while(x<i-1)
      ++x,u[x][y]=u[x-1][y]-1;
  }
  for(i=1;i<=n;++i){
    for(j=1;j<=n;++j){
      printf("%d ",u[i][j]);
      s+=((i==j||i+j==n+1)?u[i][j]:0);
    }
    printf("\n");
  }
  printf("%d",s);
  return 0;
}