【瞎搞】 FZU 2147 A-B Game

点击打开链接

x∈[1，A-1]；

要求 A%x 最大  所以x=A/2+1;

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <deque>
#include <map>
#define cler(arr, val) memset(arr, val, sizeof(arr))
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long LL;
const int MAXN = 500+1;
const int MAXM = 140000;
const int INF = 0x3f3f3f3f;
const int mod = 1000000007;
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
LL a,b,t,cas=1;
cin>>t;
while(t--)
{
int time=0;
cin>>a>>b;
while(a>b)
{
a-=(a%(a/2+1));
time++;
}
printf("Case %I64d: %d\n",cas++,time);
}
return 0;
}