KazaQ's Socks

Problem Description

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 thek -th day.

Input

The input consists of multiple test cases. (about 2000 )

For each case, there is a line contains two numbers n,k (2≤n≤10 9 ,1≤k≤10 18 ) .

Output

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.

Sample Input

3 73 64 9

Sample Output

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

规律题，多些出一些实例就很容易看出来。

#include<iostream>#include<cstdio>#include<cstring>#include<cmath>//http://acm.split.hdu.edu.cn/diy/contest_showproblem.php?pid=1002&cid=32494 using namespace std;typedef long long ll;int main(){int count;ll m,n,k,ans;count=0;while(scanf("%lld%lld",&n,&k)!=EOF){count++;if(k<=n)printf("Case #%d: %lld\n",count,k);else{k-=n;m=k%(n-1);k=(k-1)/(n-1);if(m)printf("Case #%d: %lld\n",count,m);else{if(k%2)printf("Case #%d: %lld\n",count,n);elseprintf("Case #%d: %lld\n",count,n-1);}}}return 0; }