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

#include <iostream>
using namespace std;

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    if(k < max(m, n)) {
        cout << -1 << endl;
        return 0;
    }
    int diff = k - max(m, n) + 1; //让第一行第一列的格子里放diff个，后面的k-1个格子里都是1即可

    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < m; ++j) {
            if(i == j) {
                if(i == 0) cout << diff;
                else cout << 1;
            }
            else {
                if(n > m && i >= m && j == m-1) cout << 1;
                else if(n < m && i == n-1 && j >= n) cout << 1;
                else cout << 0;
            }
            cout << " ";
        }
        cout << endl;
    }
    return 0;
}