#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
typedef long long LL;
int slove(int a,int b)
{
    if(b==0)    return 0;
    int ans=0;
    ans=a/b;
    a=a%b;
    ans+=slove(b,a);
    return ans;
}
int main()
{
    int t;
    cin>>t;
    while(t--) 
    {
        int a,b;
        scanf("%d%d",&a,&b);
        printf("%d\n",slove(max(a,b),min(a,b)));
    }
    return 0; 
}