A9213 | Levko and Table
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
Unfortunately, he doesn't know any such table. Your task is to help him to find at least one of them.
输入格式
The single line contains two integers, $n$ and $k$ ( $1<=n<=100$ , $1<=k<=1000$ ).
输出格式
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.
If there are multiple suitable tables, you are allowed to print any of them.
输入输出样例
输入 #1
2 4
输出 #1
1 3 3 1
输入 #2
4 7
输出 #2
2 1 0 4 4 0 2 1 1 3 3 0 0 3 2 2
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.
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.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted