MemSQL Start[c]UP 2.0 - Round 1
C
Magic Trick
Codeforces
2100
原题
← BD →
翻译中…

Alex enjoys performing magic tricks. He has a trick that requires a deck of $*n*$ cards. He has $*m*$ identical decks of $*n*$ different cards each, which have been mixed together. When Alex wishes to perform the trick, he grabs $*n*$ cards at random and performs the trick with those. The resulting deck looks like a normal deck, but may have duplicates of some cards.

翻译中…

The trick itself is performed as follows: first Alex allows you to choose a random card from the deck. You memorize the card and put it back in the deck. Then Alex shuffles the deck, and pulls out a card. If the card matches the one you memorized, the trick is successful.

翻译中…

You don't think Alex is a very good magician, and that he just pulls a card randomly from the deck. Determine the probability of the trick being successful if this is the case.

翻译中…

Input

翻译中…

First line of the input consists of two integers $*n*$ and $*m*$ ($1 ≤ *n*, *m* ≤ 1000$), separated by space — number of cards in each deck, and number of decks.

翻译中…

Output

翻译中…

On the only line of the output print one floating point number – probability of Alex successfully performing the trick. Relative or absolute error of your answer should not be higher than $10^{ - 6}$.

翻译中…

Note

翻译中…

In the first sample, with probability image Alex will perform the trick with two cards with the same value from two different decks. In this case the trick is guaranteed to succeed.

翻译中…

With the remaining image probability he took two different cards, and the probability of pulling off the trick is image.

翻译中…

The resulting probability is image

翻译中…

样例

Input #1
2 2
Output #1
0.6666666666666666
InputCopy OutputCopy
Input #2
4 4
Output #2
0.4000000000000000
InputCopy OutputCopy
Input #3
1 2
Output #3
1.0000000000000000
InputCopy OutputCopy
题目信息
题号
452C
时间限制
1 s
内存限制
256 MB
标签
组合数学
数学
概率论

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