Codeforces Round 265 (Div. 1)
D
World of Darkraft - 2
Codeforces
2700
原题
← CE →
翻译中…

Roma found a new character in the game "World of Darkraft - 2". In this game the character fights monsters, finds the more and more advanced stuff that lets him fight stronger monsters.

翻译中…

The character can equip himself with $*k*$ distinct types of items. Power of each item depends on its level (positive integer number). Initially the character has one $1$-level item of each of the $*k*$ types.

翻译中…

After the victory over the monster the character finds exactly one new randomly generated item. The generation process looks as follows. Firstly the type of the item is defined; each of the $*k*$ types has the same probability. Then the level of the new item is defined. Let's assume that the level of player's item of the chosen type is equal to $*t*$ at the moment. Level of the new item will be chosen uniformly among integers from segment [$1$; $*t* + 1$].

翻译中…

From the new item and the current player's item of the same type Roma chooses the best one (i.e. the one with greater level) and equips it (if both of them has the same level Roma choses any). The remaining item is sold for coins. Roma sells an item of level $*x*$ of any type for $*x*$ coins.

翻译中…

Help Roma determine the expected number of earned coins after the victory over $*n*$ monsters.

翻译中…

Input

翻译中…

The first line contains two integers, $*n*$ and $*k*$ ($1 ≤ *n* ≤ 10^{5}$; $1 ≤ *k* ≤ 100$).

翻译中…

Output

翻译中…

Print a real number — expected number of earned coins after victory over $*n*$ monsters. The answer is considered correct if its relative or absolute error doesn't exceed $10^{ - 9}$.

翻译中…

样例

Input #1
1 3
Output #1
1.0000000000
InputCopy OutputCopy
Input #2
2 1
Output #2
2.3333333333
InputCopy OutputCopy
Input #3
10 2
Output #3
15.9380768924
InputCopy OutputCopy
题目信息
题号
464D
时间限制
2 s
内存限制
256 MB
标签
动态规划
概率论

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。