D-- Little Pony and Expected Maximum(CF--453A

最新推荐文章于 2022-02-07 19:56:23 发布

IF_I

最新推荐文章于 2022-02-07 19:56:23 发布

阅读量355

点赞数

分类专栏： ---------------各种比赛----------- 2015夏季集训

本文链接：https://blog.csdn.net/zhang_di233/article/details/47860249

版权

---------------各种比赛----------- 同时被 2 个专栏收录

22 篇文章 0 订阅

订阅专栏

2015夏季集训

18 篇文章 0 订阅

订阅专栏

Description

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 m dots. Twilight Sparkle is sure that when the dice is tossed, each face appears with probability $\text{[math]}$ . 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.

题意：有一个骰子，它有m个面，第一面有1个点，第二面有2个点......第m个面有m个点，总共投掷n次，每投掷完n次就会出现这n次每个骰子出现的数中最大的数，求最大数的期望，由样例可得结果保留12位小数。【例如第3个样例：一个两面的骰子，投掷两次，投掷完两次总共会出现4种情况：1，1；1，2；2，1；2，2。4种情况出现的最大数：1，2，2，2。每种情况的概率是0.25，则最大数的期望就是：（1+2+2+2）*0.25=3.5。】

思路：由题可得出一个规律，即出现m的次数=m^n-(m-1)^n，A=1~m的每个数*每个数出现的次数，B=每种情况出现的概率即m^n，最大数的期望=A/B。上式可化简为：最大数的期望=m-(1/m)^n-(2/m)^n-......-((m-1)/m)^n。

 
  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:

You can get 1 in the first toss, and 2 in the second. Maximum equals to 2.
You can get 1 in the first toss, and 1 in the second. Maximum equals to 1.
You can get 2 in the first toss, and 1 in the second. Maximum equals to 2.
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:

$\text{[math]}$

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

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <cmath>
#define INF 0x3f3f3f3f
using namespace std;
int main()
{
    //freopen("abc.text","r",stdin);
    double m,n;
    while(~scanf("%lf %lf",&m,&n))
    {
        double ans=m;
        for(int i=1; i<=m-1; i++)
            ans-=pow(i/m,n);      //在误差允许的范围内可以用pow函数
        printf("%.12lf\n",ans);
    }
    return 0;
}