Submission #3011837

---

Source Code Expand

n,d = map(int,input().split())
i2 = 0
i3 = 0
i5 = 0
while d%2 == 0:
  d =d/2
  i2 += 1
while d%3 == 0:
  d =d/3
  i3 += 1
while d%5 == 0:
  d = d/5
  i5 += 1
if (d != 1 or i3+i2+i5 > n):
  print(0)
  exit()
dp = [[[[0 for i31 in range(40)] for i21 in range(50)] for i1 in range(70)] for i in range(101)]
dp[0][0][0][0] = 1
for i in range(n):
  for j in range(70):
    for k in range(50):
      for l in range(40):
        if dp[i][j][k][l] == 0:
          continue
        dp[i+1][j][k][l] += dp[i][j][k][l]/6
        dp[i+1][min(i2,j+1)][k][l] += dp[i][j][k][l]/6
        dp[i+1][j][min(i3,k+1)][l] += dp[i][j][k][l]/6
        dp[i+1][min(i2,j+2)][k][l] += dp[i][j][k][l]/6
        dp[i+1][j][k][min(l+1,i5)] += dp[i][j][k][l]/6
        dp[i+1][min(j+1,i2)][min(k+1,i3)][l] += dp[i][j][k][l]/6
ans = dp[n][i2][i3][i5]
print(ans)

Submission Info

Judge Result