lightOJ - 1248（概率与期望）

题目：LightOJ - 1248 

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面的骰子，计算每一面至少出现一次的需要掷骰子的期望次数；

分析：第一掷出现的概率为 1（因为第一次每一面都没见过）；

第二次掷出现未出现过的概率为 （N - 1）/ N;

第三次掷出现未出现过的概率为 （N - 2）/ N;

以此类推，满足几何分布；

几何分布的期望E = sigma1 / p;

E = n * (1 + 1 / 2 + 1 / 3 + 1 / 4 + ·····+ 1 / n);

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

int main()
{
    int T;
    int n;
    int Case = 0;
    cin >> T;
    while(T --)
    {
        cin >> n;
        double ans = 1;
        for(int i = 2;i <= n;i ++)
        {
            ans += 1.0 / i;
        }
        printf("Case %d: %.10lf\n",++ Case,ans * n);
    }
    return 0;
}