G - Dice (III)

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

题解：假设我们已经求得获得m个不同面得期望E(m).那么E(m+1)有两种情况：选取到已经选过的面的概率P1=m/n,对应的期望为E(m+1)。选取到未选取过的面对应的概率P2=(n-m)/n,对应的期望为E(m)。则E(m+1)=P1*E(m+1)+P2*E(m)+1.

化简得E(m+1)=n/(n-m).

#include<bits/stdc++.h>
using namespace std;
int main()
{
    std::ios::sync_with_stdio(0);
    int t,n,k=1;
    cin>>t;
    while(t--)
    {
        cin>>n;
        double sum=1;
        for(int i=n-1;i>=1;i--)
            sum+=n*1.0/(n-i);
        cout<<"Case "<<k++<<": ";
        cout<<fixed<<setprecision(9)<<sum<<endl;
    }
    return 0;
}