Lähetit

#!/usr/bin/env python3

n, k = [int(x) for x in input().split()]
t = [[[0] * 202 for j in range(202)] for l in range(2)]
for l in [0, 1]:
	for i in range(0, n):
		leveys = (i & ~1) + (2 - l)
		for j in range(0, min(k, leveys) + 1):
			if i > 0:
				t[l][i][j] = t[l][i-1][j]
				if j > 0:
					t[l][i][j] = (t[l][i][j] + t[l][i-1][j-1] * (leveys - (j-1))) % 1000000007
			elif j > 1:
				t[l][i][j] = 0
			elif j > 0:
				t[l][i][j] = leveys
			else:
				t[l][i][j] = 1
ret = sum(t[1][n-1][i] * t[0][n-2][k-i] for i in range(0, min(n, k) + 1)) % 1000000007
print(ret)

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED