454C. Little Pony and Expected Maximum

所有可能的情况为m^n,则当i（i = 1,2,,,,,m）为最大值是的情况为i^n - (i-1)^n（考虑将其看做i进制数，n为i进制数(n^i)中不出现数字i的情况为(n-1)^i）;

注意在计算时由于m^n太大会溢出,所以讲(i^n-(i-1)^n)/(m^n)拆为(i/m)^n - ((i-1)/m)^n;

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<cctype>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<stack>
#define ll long long
#define MAX 1000
#define INF INT_MAX
#define eps 1e-8

using namespace std;

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