for g in[*open(0)][1:]:
a,b,n=map(int,g.split())
x=max(a,b)
y=min(a,b)
t = 0
a = 1
while x <= n and y <= n:
if a:
y += x
else:
x += y
t += 1
a = 1-a
print(t)#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b,c,d,n,t,p,q,l;
cin>>t;
while(t--)
{
l=0;
cin>>a>>b>>n;
while(max(a,b)<=n)
{
if(a<b)
a=a+b;
else
b=b+a;
l++;
}
cout<<l<<endl;
}
return 0;
}
70. Climbing Stairs | 53. Maximum Subarray |
1527A. And Then There Were K | 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers |
318. Maximum Product of Word Lengths | 448. Find All Numbers Disappeared in an Array |
1155. Number of Dice Rolls With Target Sum | 415. Add Strings |
22. Generate Parentheses | 13. Roman to Integer |
2. Add Two Numbers | 515. Find Largest Value in Each Tree Row |
345. Reverse Vowels of a String | 628. Maximum Product of Three Numbers |
1526A - Mean Inequality | 1526B - I Hate 1111 |
1881. Maximum Value after Insertion | 237. Delete Node in a Linked List |
27. Remove Element | 39. Combination Sum |
378. Kth Smallest Element in a Sorted Matrix | 162. Find Peak Element |
1529A - Eshag Loves Big Arrays | 19. Remove Nth Node From End of List |
925. Long Pressed Name | 1051. Height Checker |
695. Max Area of Island | 402. Remove K Digits |
97. Interleaving String | 543. Diameter of Binary Tree |