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
一个简单的水题,结果一直WA,然后用了一个小时的时间,终于找出错误,把long long改成__int 64,就ac了,这是什么节奏,不过发现自己真的蛮有耐心的。。。
#include<stdio.h> int main() { int n,o=1; __int64 a,b,c; scanf("%d",&n); while(n--) { c=0; scanf("%I64d%I64d",&a,&b); while(a>b) { a=a/2+1; c++; } printf("Case %d: %lld\n",o++,c); } }