ACM模版

描述

Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals k.
Unfortunately, he doesn’t know any such table. Your task is to help him to find at least one of them.

Input
The single line contains two integers, n and k (1 ≤ n ≤ 100, 1 ≤ k ≤ 1000).

Output
Print any beautiful table. Levko doesn’t like too big numbers, so all elements of the table mustn’t exceed 1000 in their absolute value.
If there are multiple suitable tables, you are allowed to print any of them.
Sample Input

Input
2 4

Output
1 3
3 1

Input
4 7

Output
2 1 0 4
4 0 2 1
1 3 3 0
0 3 2 2

Hint
In the first sample the sum in the first row is 1 + 3 = 4, in the second row — 3 + 1 = 4, in the first column — 1 + 3 = 4 and in the second column — 3 + 1 = 4. There are other beautiful tables for this sample.
In the second sample the sum of elements in each row and each column equals 7. Besides, there are other tables that meet the statement requirements.

题解

一道看似很难得题，实际上，看透他的本质就水的不要不要的。要求求出每一行每一列和都等于k的矩阵，并且只要求出一种符合要求的就行。那么，对角线全部是k不就行了？

代码

#include <stdio.h>

int main()
{
    int n, m;
    int a[100][100] = {0};
    int i, j = 0;
    scanf("%d%d", &n, &m);
    for (i = 0; i < n; i++)
    {
        a[i][j] = m;
        j++;
    }
    for (i = 0; i < n; i++)
    {
        printf("%d", a[i][0]);
        for (j = 1 ; j < n; j++)
        {
            printf(" %d", a[i][j]);
        }
        printf("\n");
    }
    return 0;
}