Dice (III) LightOJ - 1248 （概率dp）-CSDN博客

本文探讨了如何计算一个n面公平骰子被掷出所有面至少一次的期望次数，并提供了一种动态规划方法来解决这个问题。对于一个n面骰子，通过递推公式计算从见到第一个面到所有面都被掷出的期望掷骰次数。

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.52 + 0.53 + …

= 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^5).

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
5
1
2
3
6
100
Sample Output
Case 1: 1
Case 2: 3
Case 3: 5.5
Case 4: 14.7
Case 5: 518.7377517640

大致题意：给你一个n面的骰子，每一次你所能甩到的每个面的概率都一样，问你将所有的面都能甩到一次的概率期望是多少。

思路：假设此时的骰子有n面，dp[i]表示此时已经甩出i个不同面的概率期望，dp[1]=1.
状态转移方程即为：dp[i]=（i-1）/n*dp[i-1]+（n-i+1）/n*dp[i]+1;
化简得：dp[i]=dp[i-1]+n/（i-1）；最后答案即为dp[n]

代码如下

#include<bits/stdc++.h>
const double eps=1e-7;
#define LL long long int
using namespace std;
const int N=1e5+5;
double dp[N];
int main()
{
    int T;
    scanf("%d",&T);
    for(int cas=1;cas<=T;cas++)
    {
        int n;
        scanf("%d",&n);
        memset(dp,0,sizeof(dp));
        dp[1]=1;
        for(int i=2;i<=n;i++)
        {
            dp[i]=dp[i-1]+1.0*n/(i-1);
        }
        printf("Case %d: %.10lf\n",cas,dp[n]);  
    }
    return 0;
}