题解 | 构造数独

#include <stdio.h>
#include <stdlib.h>

int main() {
    int n, s;
    scanf("%d %d", &n, &s);

    int* first_row = (int*)malloc(n * sizeof(int));

    int q = s / n;
    int r = s % n;

    for (int i = 0; i < n; i++) {
        if (i < r) {
            first_row[i] = q + 1;
        } else {
            first_row[i] = q;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            int index = (j - i + n) % n;
            printf("%d", first_row[index]);
            if (j < n - 1) {
                printf(" ");
            }
        }
        printf("\n");
    }
    free(first_row);
    return 0;
}