m, n = [int(i) for i in input().split()]
res = 0
for i in range(1, m+1):
res += i*(pow(i/m,n)- pow((i-1)/m, n))
print("{:.12f}".format(res))#include<bits/stdc++.h>
using namespace std;
#define int long long
int m,n;
double quick_power(double base,int x){
double ret=1;
while(x){
if(x&1)ret*=base;
base*=base;
x=x>>1;
}
return ret;
}
signed main(){
scanf("%lld %lld",&m,&n);
double ans=0;
for(int i=1;i<=m;i++)
ans+=i*(quick_power(i/1.0/m,n)-quick_power((i-1)/1.0/m,n));
printf("%lf",ans);
return 0;
}
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |
1328A - Divisibility Problem | 339A - Helpful Maths |
4A - Watermelon | 476A - Dreamoon and Stairs |
1409A - Yet Another Two Integers Problem | 977A - Wrong Subtraction |
263A - Beautiful Matrix | 180C - Letter |
151A - Soft Drinking | 1352A - Sum of Round Numbers |
281A - Word Capitalization | 1646A - Square Counting |
266A - Stones on the Table | 61A - Ultra-Fast Mathematician |
148A - Insomnia cure | 1650A - Deletions of Two Adjacent Letters |
1512A - Spy Detected | 282A - Bit++ |
69A - Young Physicist | 1651A - Playoff |
734A - Anton and Danik | 1300B - Assigning to Classes |
1647A - Madoka and Math Dad | 710A - King Moves |