cf——签（神tm浪的一匹）

最新推荐文章于 2025-11-02 20:48:42 发布

原创最新推荐文章于 2025-11-02 20:48:42 发布 · 354 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#cf #签 #思路

并查集专栏收录该内容

2 篇文章

订阅专栏

本文探讨了如何构造一个n×n的矩阵，使得每行每列的元素之和均为k。通过简单的算法实现，输出了一个满足条件的美丽矩阵。适用于喜欢数学和编程的读者。

A - 签

CodeForces - 361A

想了好久，没思路，怪我最近太浪了，还是我拿不动刀了....................

Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautifulto 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.

#include<stdio.h>
using namespace std;
int main()
{
	int n,k;
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		{
			if(i==j)
			printf("%d",k);
			else
			printf("0");
			if(j!=n)
			printf(" ");
			else
			printf("\n");
		}
		return 0;
}