#coding:utf-8
n = int(raw_input('>'))
#初始化数组
arr = [[0]*n for i in range(n)]
#递归解决
def dfs(arr, x, y, start, n):
if n<=0:return 0
if n==1:
arr[x][y] = start
return 0
#up
for i in range(n):
arr[x][y+i] = start
start += 1
#right
for i in range(n-1):
arr[x+1+i][y+n-1] = start
start += 1
#down
for i in range(n-1):
arr[x+n-1][y+n-2-i] = start
start += 1
#left
for i in range(n-2):
arr[x+n-2-i][y] = start
start += 1
dfs(arr,x+1,y+1,start,n-2)
a = dfs(arr,0,0,1,n)
#格式化输出print
l = len(str(n*n))+1
format = ('%'+str(l)+'d')*n
for tmp in arr:
print format%tuple(tmp)
机械节能产品生产企业官网模板...
大气智能家居家具装修装饰类企业通用网站模板...
礼品公司网站模板
宽屏简约大气婚纱摄影影楼模板...
蓝白WAP手机综合医院类整站源码(独立后台)...苏ICP备2024110244号-2 苏公网安备32050702011978号 增值电信业务经营许可证编号:苏B2-20251499 | Copyright 2018 - 2025 源码网商城 (www.ymwmall.com) 版权所有