米字形由一个(2n-1)×(2n-1)的矩阵组成,矩阵包含从大写A开始的n个字母
例如:n=3时,包含A,B,C;n=4时,包含A,B,C,D。
矩阵的正中间为n个字母中字典序最大的那个,从这个字母开始,沿着西北、正北、东北、正西、正东、西南、正南、东南八个方向各有一条由大写字母组成的直线。并且直线上的字母按字典序依次减小,直到大写字母A。
矩阵的其它位置用英文句号.填充。
现在Keven给你一个正整数N,想要你帮他输出这个矩阵,你能帮助他吗?
输入格式:
输入在一行中给出1个不超过26的正整数N
输出格式:
输出(2n-1)×(2n-1)的矩阵
输入样例1:
3
输出样例1:
A.A.A
.BBB.
ABCBA
.BBB.
A.A.A
输入样例2:
4
输出样例2:
A..A..A
.B.B.B.
..CCC..
ABCDCBA
..CCC..
.B.B.B.
A..A..A
n = int(input())
alpha = ["A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"]
for i in range(0,n-1):
for j in range(0,n-1):
if j == i:
print(alpha[i],end="")
else:
print(".",end="")
print(alpha[i],end="")
for j in range(0,n-1):
if j == n-2-i:
print(alpha[i],end="")
else:
print(".",end="")
print("")
for i in range(0,n-1):
print(alpha[i],end="")
print(alpha[n-1],end="")
for i in range(0,n-1):
print(alpha[n-2-i],end="")
print("")
for i in range(0,n-1):
for j in range(0,n-1):
if j == n-2-i:
print(alpha[n-2-i],end="")
else:
print(".",end="")
print(alpha[n-2-i],end="")
for j in range(0,n-1):
if j == i:
print(alpha[n-2-i],end="")
else:
print(".",end="")
print("")