#阶乘的递归
def factorial(n):
if n == 0:
return 1
else:
return n * factorial(n - 1)
k, n = input("请输入k和n的值:").split(" ")
k, n = map(int, (k, n))
m = 2 ** k #总共2^K次实验
i = 2 ** k #反向计算n,n+1……2^k成功的概率
p = 0
while i >= n: # 代入二项分布公式计算
p += (factorial(m) / (factorial(i)*factorial((m - i)))) * (0.25 ** i) * (0.75 ** (m-i))
i -= 1
print(round(p, 3))
#参考——作者:未琢 https://www.bilibili.com/read/cv2044882 出处:bilibili