A-B Game

查看 提交 统计 提问
总时间限制: 1000ms 内存限制: 32768kB
描述
  Fat brother and Maze are playing a kind of special 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 game.






输入
The first line of the data 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
输出
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.
样例输入
2 
5 3 
10086 110
样例输出
Case 1: 1 
Case 2: 7
来源

第四届福建省大学生程序设计竞赛