P3938 斐波那契(lca)

P3938 斐波那契https://www.luogu.com.cn/problem/P3938

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int m;
ll a, b;

ll c[100];

inline void find(ll a, ll b) {
	if (a < b)
		swap(a, b);
	if (a == b) {
		printf("%lld\n", a);
		return;
	}
	int w = lower_bound(c, c + 62, a) - c;
	find(b, a - c[w - 1]);
}

int main() {
	scanf("%d", &m);
	c[0] = 1, c[1] = 1;
	for (int i = 2; i <= 61; i++) {
		c[i] = c[i - 1] + c[i - 2];
	}
	while (m--) {
		scanf("%lld %lld", &a, &b);
		find(a, b);
	}
	return 0;
}