3013. Coins (VI)

单点时限: 2.0 sec

内存限制: 256 MB

In a strange shop, it has a very strange rule:

If the cost is yuan, you have yuan in hand and pay for it using yuan , so he should return yuan to you,but he refuses to sell it if you can’t show him yuan in your hand.

Now, you want to know the minmum coins you should bring with if you only know what you buy cost is no more than yuan. The value of coin can be any positive integers.

输入格式

Input starts with an integer , denoting the number of test cases.

Each test case has an integer ) in a single line.

输出格式

For each case, print the case number and the result.

样例

Input
3
1
2
5
Output
Case 1: 1
Case 2: 2
Case 3: 3

8 人解决,12 人已尝试。

8 份提交通过,共有 27 份提交。

6.6 EMB 奖励。

创建: 6 年,4 月前.

修改: 2 年,3 月前.

最后提交: 1 年,5 月前.

来源: Coins 系列

题目标签