Binary Tree

#include<stdio.h>
int main()
{
int t,a,b;
scanf("%d",&t);
for (int i = 1; i <= t; i ++)
{
int l = 0,r = 0;
scanf("%d%d",&a,&b);
while(a!=1&&b!=1)
{

if(a > b)
{
l += a/b;
a = a % b;
}
else
{
r += b/a;
b = b % a;
}
}
if(a==1)
r+=b-a;
if(b==1)
l+=a-b;
printf("Scenario #%d:\n%d %d\n",i,l,r);
if(i!=t)
printf("\n");

}
return 0;
}