第3题-【规律方阵】

/*
3. 打印一个 N*N 的方阵，Ｎ为每边 Ｎ＝１５ 打印出下面图形
字符的个数（３＜Ｎ＜２０）, 要求最 TTTTTTTTTTTTTTT
外一层为"T", 第二层为"J", 从第三层 TJJJJJJJJJJJJJT
起每层依次打印数字 1,2,3,... TJ11111111111JT
（右图以Ｎ为１５为例） TJ12222222221JT
TJ12333333321JT
TJ12344444321JT
TJ12345554321JT
TJ12345654321JT
TJ12345554321JT
TJ12344444321JT
TJ12333333321JT
TJ12222222221JT
TJ11111111111JT
TJJJJJJJJJJJJJT
TTTTTTTTTTTTTTT

*/

#include "iostream"
#include "cmath"
using namespace std;

int main()
{
const char map[81] = "TJ123456789";
int N, n;
while(cin>>N && N)
{
n = N/2;
for(int i=0; i<N; i++)
{
for(int j=0; j<N; j++)
{
int cursor = abs(i-n)>abs(j-n) ? abs(i-n) : abs(j-n);
cout << map[n-cursor];
}
cout << endl;
}
}
return 0;
}