codeforces454CLittle Pony and Expected Maximum+数学期望

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 . 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 ≤ 10^5).

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 Input
Input

6 1

Output

3.500000000000

Input

6 3

Output

4.958333333333

Input

2 2

Output

1.750000000000

Hint

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:

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

题目大意：M面的筛子，扔n次，求n次中最大值的期望。
解法：对于点数最大数i,情况数=pow(i,n)-pow(i-1,n)，除以总情况数pow(m,n)，所以概率为pow(i/m,n)-pow((i-1)/m,n)。所以期望为（pow(i/m,n)-pow((i-1)/m,n)）*i；
直接枚举点数m就好了。

#include<bits/stdc++.h>
using namespace std;

int main() {
    int n,m;
    while(scanf("%d %d",&m,&n)!=EOF) {
        double ans=0.0;
        for(int i=1;i<=m;i++){
            ans+=(pow(i*1.0/m,n)-pow((i-1)*1.0/m,n))*i;
        }
        printf("%.12f\n",ans);
    }
    return 0;
}