HDU 5640 King's Cake

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>

const int inf = 0x3f3f3f3f;//1061109567
typedef long long ll;
using namespace std;

int sum;

void cf(int n,int m)
{
if(m == 0)
return;
if(n == 1 && m == 1)
{
sum += 1;
return;
}
if(n > m)
{
swap(n,m);
}
sum += m / n;
cf(n,m%n);
}

int main()
{
int t;
scanf("%d",&t);
while(t--)
{
sum = 0;
int n,m;
scanf("%d%d",&n,&m);
cf(n,m);
printf("%d\n",sum);
}
return 0;
}