#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define MOD2 1190492669
#define SEED 131
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);
#define MAXN 100005
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;
mt19937 g1(time(0));
int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}
ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}
int N,K,dq[MAXN],l,r;
pair<double,int> dp[MAXN];
inline double inter(int j, int k){
double m1 = dp[j].first, b1 = -j;
double m2 = dp[k].first, b2 = -k;
return (b2-b1)/(m1-m2);
}
inline int getGroups(double C){
l = 1, r = 1, dq[1] = 0;
for(int i=1; i<=N; i++){
while(r-l >= 1 && dp[dq[l]].first*i-dq[l] <= dp[dq[l+1]].first*i-dq[l+1]) l++;
dp[i].first = (dp[dq[l]].first*i-dq[l])/i+1-C;
dp[i].second = dp[dq[l]].second+1;
while(r-l >= 1 && inter(dq[r-1],i) <= inter(dq[r-1],dq[r])) r--;
dq[++r] = i;
}
return dp[N].second;
}
int main(){
scanf("%d %d",&N,&K);
double low = 0, high = 20, ans = 0;
while(high-low >= 1e-15){
double mid = (low+high)/2;
int g = getGroups(mid);
if(g <= K){
ans = mid;
high = mid-1e-15;
}else low = mid+1e-15;
}
getGroups(ans);
double res = dp[N].first+ans*K;
printf("%.8f\n",res);
}
/*
2 1
ans=1.5
*/
