logo AlgoBeat OnlineJudge
登录 注册

#213558. [GCJ 2009 #1A] Collecting Cards

内存限制:1024 MiB 时间限制:3000 ms 标准输入输出
题目类型:VJudge(洛谷) 评测方式:VJudge
上传者: 匿名

题目描述

You've become addicted to the latest craze in collectible card games, PokeCraft: The Gathering. You've mastered the rules! You've crafted balanced, offensive, and defensive decks! You argue the merits of various cards on Internet forums! You compete in tournaments! And now, as they just announced their huge new set of cards coming in the year 2010, you've decided you'd like to collect every last one of them! Fortunately, the one remaining sane part of your brain is wondering: how much will this cost?

There are kinds of card in the coming set. The cards are going to be sold in "booster packs", each of which contains cards of different kinds. There are many possible combinations for a booster pack where no card is repeated. When you pay for one pack, you will get any of the possible combinations with equal probability. You buy packs one by one, until you own all the kinds. What is the expected (average) number of booster packs you will need to buy?

输入格式

The first line of input gives the number of cases, . test cases follow, each consisting of a line containing and .

输出格式

For each test case, output one line in the form

Case #:

where is the case number, starting from 1, and is the expected number of booster packs you will need to buy. Any answer with a relative or absolute error at most will be accepted.

样例

样例输入 1

2
2 1
3 2

样例输出 1

Case #1: 3.0000000
Case #2: 2.5000000

数据范围与提示

Limits

Small dataset(10 Pts)

Large dataset(30 Pts)