算法 两种方式构造数独 循环矩阵 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StreamTokenizer in = new StreamTokenizer(br); PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out)); in.nextToken(); int n = (int) in.nval; in.nextToken(); int k = (int) in.nval; int[] firstRow = new int[n]; int q = k/n; int r = k%n; /** * sum(firstRow) = r*(q+1) + (n-r)*q = n*q + r = k */ for(int i=0;i<n;i++){ if(i<r){ firstRow[i]=q+1; }else{ firstRow[i]=q; } } for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ //第i行是第一行循环左移 i 位的结果 //加n可避免j-i为负数时取模出错 out.print(firstRow[(j-i+n)%n]+(j==n-1?"":" ")); } out.println(); } out.flush(); out.close(); br.close(); } 方法2-YYDS(有一点马叉虫) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StreamTokenizer in = new StreamTokenizer(br); PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out)); in.nextToken(); int n = (int) in.nval; in.nextToken(); int k = (int) in.nval; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i == j) { out.print(k + (j == n - 1 ? "" : " ")); } else { out.print(0 + (j == n - 1 ? "" : " ")); } } out.println(); } out.flush(); out.close(); br.close(); }