A12910 | Another Filling the Grid
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You have $n \times n$ square grid and an integer $k$ . Put an integer in each cell while satisfying the conditions below.
- All numbers in the grid should be between $1$ and $k$ inclusive.
- Minimum number of the $i$ -th row is $1$ ( $1 \le i \le n$ ).
- Minimum number of the $j$ -th column is $1$ ( $1 \le j \le n$ ).
Find the number of ways to put integers in the grid. Since the answer can be very large, find the answer modulo $(10^{9} + 7)$ .
 These are the examples of valid and invalid grid when $n=k=2$ .
- All numbers in the grid should be between $1$ and $k$ inclusive.
- Minimum number of the $i$ -th row is $1$ ( $1 \le i \le n$ ).
- Minimum number of the $j$ -th column is $1$ ( $1 \le j \le n$ ).
Find the number of ways to put integers in the grid. Since the answer can be very large, find the answer modulo $(10^{9} + 7)$ .
 These are the examples of valid and invalid grid when $n=k=2$ .
输入格式
The only line contains two integers $n$ and $k$ ( $1 \le n \le 250$ , $1 \le k \le 10^{9}$ ).
输出格式
Print the answer modulo $(10^{9} + 7)$ .
输入输出样例
输入 #1
2 2
输出 #1
7
输入 #2
123 456789
输出 #2
689974806
In the first example, following $7$ cases are possible.
In the second example, make sure you print the answer modulo $(10^{9} + 7)$ .
In the second example, make sure you print the answer modulo $(10^{9} + 7)$ .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted