Dice (III) （LightOJ-1248） （概率DP）

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 ≤ 105).

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个面的骰子，问扔出所有面的期望次数。

思路：设E(m)表示得到m个不同面的期望次数。E(m+1)=[((n-m)/n)*E(m)+1]+(m/n)*E(m+1); 当得到m个面时他有((n-m)/n)的概率得到没得到过的面。如果他有(m/n)的概率出到不同面也有1-(m/n)的概率得到相同面，所以直接加上((n-m)/n)*E(m+1)即可。
AC代码：

#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <iomanip>
typedef long long ll;
const int maxx=10010;
const int inf=0x3f3f3f3f;
using namespace std;
int main()
{
    int t;
    cin>>t;
    int k=0;
    while(t--)
    {
        k++;
        int n;
        cin>>n;
        double sum=1;
        for(int i=2; i<=n ;i++)
        {
            sum=sum+(double)(1.0*n/(n-i+1));
        }
        cout<<"Case "<<k<<": "<<fixed<<setprecision(7)<<sum<<endl;
    }
    return 0;
}