求解概率的坑题

最新推荐文章于 2025-06-15 18:04:51 发布

转载最新推荐文章于 2025-06-15 18:04:51 发布 · 137 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/tianxia2s/p/3911904.html

部署运行你感兴趣的模型镜像

D - Problem D

Time Limit:1000MS Memory Limit:131072KB 64bit IO Format:%lld & %llu

Submit Status

Description

We choose an integer K (K > 0). Then we generate N (N > 0) integers one by one randomly, each of them is in range [0, K - 1], and the appearing probabilities of each interger is the same,they are all 1/K.
Can you tell us the expectation of the number of distinct integers in that N integers?

Input

There is an integer T (1 <= T <= 200) in the first line, means there are T test cases in total.
For each test case, there are two integers K (1 <= K <= 1000), N (1 <= N <= 1000), which have the same meaning as above.

Output

For each test case, you should print the result in one line. You should keep the first 5 digits after the decimal point.

Sample Input

Sample Output

 1 #include <cstdio>
 2 double dp[1005];
 3 int main(){
 4     int n,t;
 5     double k;
 6     scanf("%d", &t);
 7     while (t--) {
 8         scanf("%lf %d", &k, &n);
 9         dp[1] = 1.0;
10         for (int i = 2; i <= n; ++i)
11             dp[i] = dp[i-1] + (k - dp[i-1])/k;
12         printf("%.5f\n", dp[n]);
13     }
14     return 0;
15 }

绝对是被坑了，一直都没有想到通过递推的的方式来求解，结果计算越来越复杂，后来就不能忍了，受不了，以后坚决不能犯这样的低级错误……

转载于:https://www.cnblogs.com/tianxia2s/p/3911904.html

您可能感兴趣的与本文相关的镜像

LobeChat

AI应用

LobeChat 是一个开源、高性能的聊天机器人框架。支持语音合成、多模态和可扩展插件系统。支持一键式免费部署私人ChatGPT/LLM 网络应用程序。