10.25解题报告

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 
 4 typedef long long LL;
 5 
 6 LL f[61] = {0, 1};
 7 
 8 int main() {
 9     freopen("fibonacci.in", "r", stdin);
10     freopen("fibonacci.out", "w", stdout);
11     for (int i = 2; i <= 60; i++) f[i] = f[i - 1] + f[i - 2];
12     int n;
13     scanf("%d", &n);
14     while (n--) {
15         LL a, b;
16         scanf("%lld%lld", &a, &b);
17         int x = 60, y = 60;
18         while (a != b) {
19             if (a > b) swap(a, b), swap(x, y);
20             while (f[y] >= b) y--;
21             b = b - f[y];
22         }
23         printf("%lld\n", a);
24     }
25 }