P9160 - First Last

内存限制：128 MB 时间限制：1 S

题面：传统评测方式：文本比较上传者：

提交：1 通过：1

Xiao Fan is playing a game with

n

players, where you always find himself ranking either first or last.

This is quite strange, right? One possible explanation is that the game system is rigged; another possible explanation is that Xiao Fan is risk-taking and would seize every opportunity to reach the top spot at the expense of lower expected scores.

Now, suppose Xiao Fan is an average player who ranks uniformly at random each time independently. How likely is it that Xiao Fan is always the ``outstanding'' one, either first or last, in

m

consecutive games?

To be more precise, in an

n

player game, an average player takes rank

\leq i \leq n)

with probability

1 / n

. The first means the rank

1

, and the last means the rank

n

Input contains two integers,

\leq n, m \leq 20)

, the number of players in each game and the number of games to be considered.

Print a real number presented by decimal format, denoting the possibility.
Your answer will be accepted if the absolute or relative error is at most

10 ^ {-9}

4 10

0.000976562500000

牛客多校10

9160: First Last

题目描述

输入格式

输出格式

输入样例复制

输出样例复制

分类标签