AcWing 754. 平方矩阵 II - Java
原题链接
简单
作者:
KYCygni
,
2021-03-16 09:03:08
,
所有人可见
,
阅读 300
Java 代码
import java.util.Scanner;
public class Main
{
public static void main (String[] args)
{
Scanner cin = new Scanner(System.in);
int n = cin.nextInt();
while (n > 0)
{
int[][] m = new int[n][n];
for (int i = 0; i < n; i ++)
{
m[i][i] = 1;
int k = 2;
for (int j = i + 1; j < n; j ++)
{
m[i][j] = k;
m[j][i] = k;
k += 1;
}
}
for (int i = 0; i < n; i ++)
{
for (int j = 0; j < n; j ++)
System.out.print(m[i][j] + " ");
System.out.print("\n");
}
System.out.print("\n");
n = cin.nextInt();
}
}
}