// Problem: C. Little Pony and Expected Maximum
// Contest: Codeforces - Codeforces Round 259 (Div. 2)
// URL: https://codeforces.com/contest/454/problem/C#
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define rep1(i, j, n) for (int i(j); i <= n; ++i)
#define rep2(i, j, n) for (int i(j); i >= n; --i)
#define rep(i, n) for (int i(0); i < n; ++i)
#define per(i, n) for (int i(n - 1); ~i; --i)
#define i64 long long
#define ld long double
using namespace std;
signed main(void) {
ios :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n, m;
cin >> m >> n;
ld ans = 0;
rep1(i, 1, m) {
ans += i * (powl(1.0 * i / m, 1.0 * n) - powl((i - 1.0) / m, 1.0 * n));
} cout << setprecision(12) << fixed << ans;
}
1605B - Reverse Sort | 1607C - Minimum Extraction |
1604B - XOR Specia-LIS-t | 1606B - Update Files |
1598B - Groups | 1602B - Divine Array |
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |