-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathprob191.py
47 lines (40 loc) · 1.07 KB
/
prob191.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
## answer[i+1][2][0] = answer[i][2][0] answer[i][2][1] answer[i][1][0] answer[i][1][1] answer[i][0][0] answer[i][0][1]
import numpy
dp = numpy.zeros((30,3,2))
dp[0][0][0] = 1 #o
dp[0][1][0] = 1 #a
dp[0][2][0] = 0
dp[0][0][1] = 1 #l
dp[0][1][1] = 0
dp[0][2][1] = 0
for i in range(1,30):
for j in range(3):
for k in range(2):
if j == 0:
if k == 0:
#ooo ooo ooa oaa
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j+1][k] +dp[i-1][j+2][k]
else:
#ooaaa...oool oooo + oooao + oaao + oaal+ oaal + oool
dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j+1][k] +dp[i-1][j+2][k] + dp[i-1][j][k-1] + dp[i-1][j+1][k-1] +dp[i-1][j+2][k-1]
if j == 1:
if k == 0:
# 00a 000a
dp[i][j][k] = dp[i-1][j-1][k]
else:
# 00a oooa
dp[i][j][k] = dp[i-1][j-1][k]
if j == 2:
if k == 0:
#0aa
dp[i][j][k] = dp[i-1][j-1][k]
else:
dp[i][j][k] = dp[i-1][j-1][k]
i = 29
ans = 0
for j in range(3):
for k in range(2):
print i,j,k, dp[i][j][k]
ans += dp[i][j][k]
print ans
##