Binary Tree

必须用除法才行，简单的加减法会超时

#include <stdio.h>
int l,r;


void f(int a,int b) {
    l=r=0;
    int k;
    while(a!=1||b!=1) {
        if (a>b) {
            k = a/b;
            if(b==1) {
            l+=k-1; break;}
            else l+=k; 
            a = a-k*b;
        }
        else {
            k = b/a;
            if (a==1) { 
            r+=k-1; break; 
            } else {
                r+=k;
                b=b-k*a;
            }
        }
    }

}


int main() {
    int t;
    scanf("%d",&t);
    int i=1;
    while(t--) {
        int a,b;
        scanf("%d%d",&a,&b);
        f(a,b);
        printf("Scenario #%d:\n",i++);
        printf("%d %d\n\n",l,r);
    }
}