zoukankan      html  css  js  c++  java
  • codeforces 453A Little Pony and Expected Maximum 最大值期望

    A. Little Pony and Expected Maximum
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Twilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept losing. Having returned to the castle, Twilight Sparkle became interested in the dice that were used in the game.

    The dice has m faces: the first face of the dice contains a dot, the second one contains two dots, and so on, the m-th face contains mdots. Twilight Sparkle is sure that when the dice is tossed, each face appears with probability . Also she knows that each toss is independent from others. Help her to calculate the expected maximum number of dots she could get after tossing the dice n times.

    Input

    A single line contains two integers m and n (1 ≤ m, n ≤ 105).

    Output

    Output a single real number corresponding to the expected maximum. The answer will be considered correct if its relative or absolute error doesn't exceed 10  - 4.

    Sample test(s)
    input
    6 1
    
    output
    3.500000000000
    
    input
    6 3
    
    output
    4.958333333333
    
    input
    2 2
    
    output
    1.750000000000
    
    Note

    Consider the third test example. If you've made two tosses:

    1. You can get 1 in the first toss, and 2 in the second. Maximum equals to 2.
    2. You can get 1 in the first toss, and 1 in the second. Maximum equals to 1.
    3. You can get 2 in the first toss, and 1 in the second. Maximum equals to 2.
    4. You can get 2 in the first toss, and 2 in the second. Maximum equals to 2.

    The probability of each outcome is 0.25, that is expectation equals to:

    You can read about expectation using the following link: http://en.wikipedia.org/wiki/Expected_value

    m面的骰子,投掷n次。得最大面为k的概率是:k^m/n^m-(k-1)^m/n^m=(k/n)^m-最大值为k-1的概率。

    //31 ms	 0 KB
    #include<stdio.h>
    #include<math.h>
    int main()
    {
        double n,m;
        while(scanf("%lf%lf",&m,&n)!=EOF)
        {
            double a=0,c=0;
            for(int i=1;i<=m;i++)
            {
                double b=pow((double)(i)/m,n);
                a+=(b-c)*i;
                c=b;
            }
            printf("%.12lf
    ",a);
        }
        return 0;
    }
    


  • 相关阅读:
    iis 7.5应用程序池自动停止
    百度云推送
    两点经纬度之间距离计算
    集合已修改;可能无法执行枚举操作。
    【百度地图】- 学习.1
    阿里云服务器下安装LAMP环境(CentOS Linux 6.3)
    微信相关内容
    阿里云服务器下安装LAMP环境(CentOS Linux 6.3)
    php面试相关
    MySQL权限管理
  • 原文地址:https://www.cnblogs.com/wgwyanfs/p/7182253.html
Copyright © 2011-2022 走看看