zoukankan      html  css  js  c++  java
  • CF 148D D. Bag of mice (概率DP||数学期望)

    The dragon and the princess are arguing about what to do on the New Year's Eve. The dragon suggests flying to the mountains to watch fairies dancing in the moonlight, while the princess thinks they should just go to bed early. They are desperate to come to an amicable agreement, so they decide to leave this up to chance.

    They take turns drawing a mouse from a bag which initially contains w white and b black mice. The person who is the first to draw a white mouse wins. After each mouse drawn by the dragon the rest of mice in the bag panic, and one of them jumps out of the bag itself (the princess draws her mice carefully and doesn't scare other mice). Princess draws first. What is the probability of the princess winning?

    If there are no more mice in the bag and nobody has drawn a white mouse, the dragon wins. Mice which jump out of the bag themselves are not considered to be drawn (do not define the winner). Once a mouse has left the bag, it never returns to it. Every mouse is drawn from the bag with the same probability as every other one, and every mouse jumps out of the bag with the same probability as every other one.

    Input

    The only line of input data contains two integers w and b (0 ≤ w, b ≤ 1000).

    Output

    Output the probability of the princess winning. The answer is considered to be correct if its absolute or relative error does not exceed 10 - 9.

    Example

    Input

    1 3

    Output

    0.500000000

    Input

    5 5

    Output

    0.658730159

    Note

    Let's go through the first sample. The probability of the princess drawing a white mouse on her first turn and winning right away is 1/4. The probability of the dragon drawing a black mouse and not winning on his first turn is 3/4 * 2/3 = 1/2. After this there are two mice left in the bag — one black and one white; one of them jumps out, and the other is drawn by the princess on her second turn. If the princess' mouse is white, she wins (probability is 1/2 * 1/2 = 1/4), otherwise nobody gets the white mouse, so according to the rule the dragon wins.

     题意:

    一对情侣开房玩抓老鼠游戏,老鼠有黑白两色,女的为先手,先抓到白老鼠胜。特别的,男的每抓一只老鼠后,也会随机放走一只老鼠。问女的赢的概率是多少。如果输了,后果会很严重,当天晚上只能睡沙发。

    思路:

    dp[i][j]为当前状态,有i只白老鼠,j只黑老鼠,女的赢的概率。那么dp[][] = 这一次赢 + 以后赢=   i/(i+j) +  。。。具体如下。

    #include<cstdio>
    #include<cstdlib>
    #include<iostream>
    #include<algorithm>
    #include<cstring>
    using namespace std;
    double dp[1010][1010];    int  w,b,i,j;
    int main()
    {
        while(~scanf("%d%d",&w,&b)){
            memset(dp,0,sizeof(dp));
            for(i=0;i<=w;i++)
             for(j=0;j<=b;j++){
                if(i==0) { dp[i][j]=0;   continue;}
                if(j==0) { dp[i][j]=1.0; continue;}
                 dp[i][j]=1.0*i/(i+j);    
                if(j>=2) dp[i][j]+=(1.0*j/(i+j))*(j-1)/(i+j-1)*i/(i+j-2)*dp[i-1][j-2];
                if(j>=3) dp[i][j]+=(1.0*j/(i+j))*(j-1)/(i+j-1)*(j-2)/(i+j-2)*dp[i][j-3];
            
            }
            printf("%.9lf
    ",dp[w][b]);
        }return 0;
    }
  • 相关阅读:
    自定义容器,支持创建普通实例,单例,线程单例
    Unity创建实例:普通实例,单例,线程单例
    自定义容器,利用依赖注入创建对象
    容器Unity实现IOC+DI
    实现高层依赖低层通过抽象类来实现,保证项目的可扩展性
    接口,抽象类,继承,多态,重写
    Linux--如何实现虚拟机与主机之间的文件传输无需第三方,即可轻松设置共享文件夹(适合所有人群)
    Linux--常用的linux基本命令学习大全01(适合所有人群)
    reset.css下载
    vue项目中,'webpack-dev-server' 不是内部或外部命令,也不是可运行的程序
  • 原文地址:https://www.cnblogs.com/hua-dong/p/8044599.html
Copyright © 2011-2022 走看看