FZU_2147_A-B_GAME

/*
Problem 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
*/

#include <stdio.h>
int main()
{
	__int64 x,a,b;
	int T;
	int count=0,time=0;
	scanf("%d",&T);
	while(T--){
		count++;
		time=0;
		scanf("%I64d %I64d",&a,&b);
		while(a>b){
			x=a/2+1;
			a=a-(a%x);
			time++;
		}
		printf("Case %d: %d\n",count,time);
	}
	return 0;
}