您当前位置：首页 > php开源 > php教程 > LightOJ1248---Dice (III)(概率dp)

LightOJ1248---Dice (III)(概率dp)

来源：程序员人生发布时间：2015-06-05 09:18:46 阅读次数：2766次

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⑹ will be ignored.
Sample Input

Output for Sample Input

100

Case 1: 1

Case 2: 3

Case 3: 5.5

Case 4: 14.7

Case 5: 518.7377517640

Problem Setter: Jane Alam Jan

水题几率dp

/*************************************************************************
    > File Name: g.cpp
    > Author: ALex
    > Mail: zchao1995@gmail.com 
    > Created Time: 2015年04月30日 星期4 16时17分00秒
 ************************************************************************/

#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <map>
#include <bitset>
#include <set>
#include <vector>

using namespace std;

const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const double eps = 1e⑴5;
typedef long long LL;
typedef pair <int, int> PLL;

double dp[100100];
int n;

double dfs(int cur) {
    if (dp[cur] != -1.0) {
        return dp[cur];
    }
    double p = (n * 1.0 / (n - cur));
    dp[cur] = dfs(cur + 1) + p;
    return dp[cur];
}

int main() {
    int icase = 1, t;
    scanf("%d", &t);
    while (t--) {
        scanf("%d", &n);
        for (int i = 0; i <= n; ++i) {
            dp[i] = -1.0;
        }
        dp[n] = 0;
        printf("Case %d: %.12f
", icase++, dfs(0));
    }
}

生活不易，码农辛苦
如果您觉得本网站对您的学习有所帮助,可以手机扫描二维码进行捐赠
程序员人生

------分隔线----------------------------

上一篇 [置顶] jenkins服务器部署（二）――任务构建

下一篇 日志收集系统Flume调研笔记第2篇 - Flume配置及使用实例

分享到:

------分隔线----------------------------

为码而活

积分：4237

15粉丝

7关注

栏目热点