A8881 | Parallel Programming
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
The first line contains two space-separated integers $n$ and $k$ $(1<=n<=10^{4},1<=k<=20)$ .
It is guaranteed that at the given $n$ and $k$ the required sequence of operations exists.
It is guaranteed that at the given $n$ and $k$ the required sequence of operations exists.
输入格式
Print exactly $n·k$ integers in $k$ lines. In the first line print numbers $c_{1},c_{2},...,c_{n}$ $(1<=c_{i}<=n)$ for the first increment operation. In the second line print the numbers for the second increment operation. In the $k$ -th line print the numbers for the $k$ -th increment operation.
As a result of the printed operations for any $i$ value $a_{i}$ must equal $n-i$ .
As a result of the printed operations for any $i$ value $a_{i}$ must equal $n-i$ .
输出格式
无
输入输出样例
输入 #1
1 1
输出 #1
1
输入 #2
3 2
输出 #2
2 3 3 3 3 3
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted