3988：Harry Potter and the Hide Story

题目描述

iSea is tired of writing the story of Harry Potter, so, lucky you, solving the following problem is enough.

输入解释

The first line contains a single integer T, indicating the number of test cases.
Each test case contains two integers, N and K.

Technical Specification

1. 1 <= T <= 500
2. 1 <= K <= 1 000 000 000 000 00
3. 1 <= N <= 1 000 000 000 000 000 000

输出解释

For each test case, output the case number first, then the answer, if the answer is bigger than 9 223 372 036 854 775 807, output “inf” (without quote).

输入样例

2
2 2
10 10

输出样例

Case 1: 1
Case 2: 2

来自杭电HDUOJ的附加信息

Author	iSea@WHU
Recommend	lcy

该题目是Virtual Judge题目，来自杭电HDUOJ

题目来源 2011 Multi-University Training Contest 15 - Host by WHU

源链接： HDU-3988

最后修改于 2020-10-25T23:09:02+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
10000/5000MS(Java/Others)	65536/65536K(Java/Others)