这题目太容易产生歧义了,要不然就是我阅读理解太垃圾
另外,蓝桥杯不让用numpy
n ,m =map(int,(input().split()))
dp = [[0]*25 for i in range(25)]
dp[1][1]=1
p = 1/n
for i in range(2,m+1):
for j in range(1,n+1):
if(j==1):
dp[i][j] = pow(p,i-1)
else:
dp[i][j] = dp[i-1][j]*j*p+dp[i-1][j-1]*(n-j+1)*p
print("%.4f"%dp[m][n])