ACM-ICPC-OJ训练营

问题 K: KazaQ's Socks

时间限制: 2 Sec 内存限制: 128 MB
提交: 1 解决: 0
[提交][状态][讨论版][命题人:]

题目描述

KazaQ wears socks everyday.

At the beginning, he has

n pairs of socks numbered from

1 to

n in his closets.

Every morning, he puts on a pair of socks which has the smallest number in the closets.

Every evening, he puts this pair of socks in the basket. If there are

n−1 pairs of socks in the basket now, lazy KazaQ has to wash them. These socks will be put in the closets again in tomorrow evening.

KazaQ would like to know which pair of socks he should wear on the

k-th day.

输入描述

The input consists of multiple test cases. (about

2000)

For each case, there is a line contains two numbers

n,k

(2≤n≤109,1≤k≤1018).

输出描述

For each test case, output "Case #x: y" in one line (without quotes), where

x indicates the case number starting from

1 and

y denotes the answer of corresponding case.

样例输入

3 7
3 6
4 9

样例输出

Case #1: 3
Case #2: 1
Case #3: 2

[提交][状态]

ACM算法攻关部