| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 1024 MB | 25 | 19 | 17 | 89.474% |
You have $n \times n$ square grid and an integer $k$. Put an integer in each cell while satisfying the conditions below.
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)$.
2 2
7
123 456789
689974806
In the first example, following 7ドル$ cases are possible.
In the second example, make sure you print the answer modulo $(10^{9} + 7)$.
Contest > Codeforces > Codeforces Round 589 (Div. 2) E번