FZU 2147 A-B Game

Description

Fat brother and Maze are playing a kind of special (hentai) game by two integers A and B. First Fat brother write an integer A on a white paper and then Maze start to change this integer. Every time Maze can select an integer x between 1 and A-1 then change A into A-(A%x). The game ends when this integer is less than or equals to B. Here is the problem, at least how many times Maze needs to perform to end this special (hentai) game.

Input

The first line of the date is an integer T, which is the number of the text cases.

Then T cases follow, each case contains two integers A and B described above.

1 <= T <=100, 2 <= B < A < 100861008610086

Output

For each case, output the case number first, and then output an integer describes the number of times Maze needs to perform. See the sample input and output for more details.

Sample Input

2
5 3
10086 110

Sample Output

Case 1: 1
Case 2: 7

解析

这个题找贪心，每次变换后的数字要尽量小，那么x尽量接近A/2。若A为偶x=A/2+1，若A为奇x=(A+1)/2。
等式变换一下就有：

	if(a%2==0) a=(a>>1)+1;
	else a=(a+1)>>1;

代码：

#include<iostream>
#include<cstdio>

using namespace std;
int T;

void work()
{
	long long a,b;
//	scanf("%I64d%I64d",&a,&b);
	cin >> a >>b; 
	int time=0;

	while(a>b)
	{
		time++;
		if(a%2==0) a=(a>>1)+1;
		else a=(a+1)>>1;
	}
	printf("%d\n",time);
}

int main()
{
	freopen("HABGame.in","r",stdin);
	freopen("HABGame.out","w",stdout);

	scanf("%d",&T);
	for(int i=1;i<=T;i++)
	{
		printf("Case %d: ",i);
		work();
	}

	return 0;
}