A9625 | World of Darkraft - 2
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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.
输入格式
The first line contains two integers, $n$ and $k$ ( $1<=n<=10^{5}$ ; $1<=k<=100$ ).
输出格式
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}$ .
输入输出样例
输入 #1
1 3
输出 #1
1.0000000000
输入 #2
2 1
输出 #2
2.3333333333
输入 #3
10 2
输出 #3
15.9380768924
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted