Dice (III) LightOJ - 1248

最新推荐文章于 2020-03-25 09:13:15 发布

转载最新推荐文章于 2020-03-25 09:13:15 发布 · 136 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/zgglj-com/p/7787708.html

本文介绍了一个关于掷骰子的概率问题：求掷出骰子所有面至少一次的期望次数。通过递推公式计算不同面数的骰子所需掷出次数，并提供了一段C++代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a dice with n sides, you have to find the expected number of times you have to throw that dice to see all its faces at least once. Assume that the dice is fair, that means when you throw the dice, the probability of occurring any face is equal.

For example, for a fair two sided coin, the result is 3. Because when you first throw the coin, you will definitely see a new face. If you throw the coin again, the chance of getting the opposite side is 0.5, and the chance of getting the same side is 0.5. So, the result is

1 + (1 + 0.5 * (1 + 0.5 * ...))

= 2 + 0.5 + 0.5² + 0.5³ + ...

= 2 + 1 = 3

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with a line containing an integer n (1 ≤ n ≤ 10⁵).

Output

For each case, print the case number and the expected number of times you have to throw the dice to see all its faces at least once. Errors less than 10^-6 will be ignored.

Sample Input

100

Sample Output

Case 1: 1

Case 2: 3

Case 3: 5.5

Case 4: 14.7

Case 5: 518.7377517640

http://blog.youkuaiyun.com/u014552756/article/details/51462135

突然发现我的概率之菜

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 
 4 const int maxn=1e5+5;
 5 
 6 int kase,n;
 7 double dp[maxn];
 8 
 9 int main()
10 {   cin>>kase;
11     for(int t=1;t<=kase;t++){
12         cin>>n;
13         dp[1]=1.0;
14         for(int i=2;i<=n;i++) dp[i]=dp[i-1]+double(n)/(double(i)-1.0);
15         printf("Case %d: %lf\n",t,dp[n]);
16     }
17     return 0;
18 }

转载于:https://www.cnblogs.com/zgglj-com/p/7787708.html