题解 | 球格模型（简单版）

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        int k = in.nextInt();
        int max = Math.max(n, m);
        if (k < max) {
            System.out.print("-1");
            return;
        }
        int[][] grid = new int[n][m];
        if (n <= m) {
            for (int i = 0; i < n; i++) {
                grid[i][i] = 1;
            }
            for (int j = n; j < m; j++) {
                grid[0][j] = 1;
            }
        } else {
            for (int i = 0; i < m; i++) {
                grid[i][i] = 1;
            }
            for (int j = m; j < n; j++) {
                grid[j][0] = 1;
            }
        }
            grid[0][0] += k - max;
        for (int[] nums : grid) {
            for (int num : nums) {
                System.out.print(num + " ");
            }
            System.out.println();
        }
    }
}