java - 拉丁方阵

import java.util.Scanner;

 

public class LatinBrick {

       public static void main(String[] args){

            Scanner s = new Scanner(System. in);

             int n = s.nextInt();

             int[][] a = new int[n][n];

             int[] b = new int[n];

             int m = 0;

            

             for(int i=0;i<n;i++){

                  b[i] = i;

            }

             int[] c = b.clone();

            

             for(int i=0;i<a.length;i++){

                   for(int j=0;j<a.length;j++){

                         int k = j + 1;

                         if(k>=n){

                              b[j] = c[m];

                        }

                         else{

                              b[j] = b[k];

                        }

                        a[i][j] = b[j];

                  }

                  m++;

            }

            

             for (int [] i : a) {

                   for (int o : i) {

                        System. out.print(o + "  " );

                  }

                  System. out.println();

            }

            

      }

}