P3938 斐波那契

 1 #include <iostream>
 2 #include <cstring> 
 3 using namespace std;
 4 typedef long long LL;
 5 const int N = 70;
 6 LL f[N] = {0,1};
 7 int m;
 8 LL lca(LL a,LL b)
 9 {
10     while(a!=b) 
11     {
12         if(a<b) swap(a,b);
13         int l = 0,r = 60;
14         while(l<r)
15         {
16             int mid = l+r+1>>1;
17             if(f[mid]<a) l = mid;
18             else r = mid-1;
19         }
20         a-=f[r];
21     }
22     return a;
23 }
24 int main()
25 {
26     scanf("%d",&m);
27     for(int i=2;i<=N-10;i++) f[i] = f[i-1]+f[i-2];
28     while(m--)
29     {
30         LL a,b; scanf("%lld%lld",&a,&b);
31         printf("%lld\n",lca(a,b));
32     }
33     return 0;
34 }