当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3927：Math Geek

Special Judge 特殊评判
题目描述
Sheldon's board has been changed! Someone drew a N * N grid on his board. Although he has no idea who's the bad guy, but as a math geek, he decide to play a game on it. He will fill in the grids with integer 1 to N*N. And the sum of each row, each column and each diagonal are distinct (2N+2 distinct integers in total).
输入解释
The first line contains a single positive integer T( T <= 200 ), indicates the number of test cases.
For each test case: an integer N (3 <= N <= 200).
输出解释
For each test case: output the case number as shown and an N * N matrix.
The output must contains N+1 lines, or you maybe get wrong answer because of special judge.
The numbers in each line must be separated by a blankspace or a tab. leading and trailing blankspace will be ignored.
输入样例 
2
3
4
输出样例 
Case #1:
7 5 2
1 4 8
3 6 9
Case #2:
2 8 15 1
5 12 10 16
6 9 4 14
3 7 11 13
提示
Huge output.
C/C++ user please use printf.

Java user please use PrintWriter. Because of Special Judge, please use .print() method shown as below:
PrintWriter out = new PrintWriter(System.out);
out.print( "Case #" + caseT + ":\n" );
out.close(); // Important!!!
来自杭电HDUOJ的附加信息
Recommend xubiao
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 2011 Multi-University Training Contest 9 - Host by BJTU
源链接： HDU-3927
最后修改于 2020-10-25T23:08:23+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
4000/2000MS(Java/Others) 122768/62768K(Java/Others)