蛇形填数

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <map>

using namespace std;

const int maxn = 20;

int a[maxn][maxn];

int main(){
    int n,tot=0;
    cin>>n;
    memset(a,0,sizeof(a));
    int x=0,y=n-1;
    a[x][y]=1;
    tot++;
    while(tot<n*n){
        while(x+1<n&&!a[x+1][y])a[++x][y]=++tot;
        while(y-1>=0&&!a[x][y-1])a[x][--y]=++tot;
        while(x-1>=0&&!a[x-1][y])a[--x][y]=++tot;
        while(y+1<n&&!a[x][y+1])a[x][++y]=++tot;
    }
    for(x=0;x<n;x++){
        for(y=0;y<n;y++){
           printf("%3d",a[x][y]);
        }
        cout<<endl;
    }
    return 0;
}