def solution(n, result):
result_dict = {0: 0}
temp = 1
for i in result:
temp *= i
if result_dict.get(i):
result_dict[i] += 1
else:
result_dict[i] = 1
temp = 1 / temp
result_set = sorted(list(set(result)))
result_set = [0] + result_set
res = 0
index = n
k = len(result_set) - 1
for i in range(k):
temp *= result_set[i] ** result_dict[result_set[i]]
index -= result_dict[result_set[i]]
for j in range(result_set[i] + 1, result_set[i + 1] + 1):
res += j * temp * (j ** index - (j - 1) ** index)
return res
n = int(input())
result = list(map(int, input().strip().split()))
print(solution(n,result))
第三题求期望
最新推荐文章于 2024-03-24 10:30:26 发布