2014 xi'an K Last Defence Gym 100548K

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<set>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define for0(a, n) for (int (a) = 0; (a) < (n); (a)++)
#define for1(a, n) for (int (a) = 1; (a) <= (n); (a)++)
#define mes(a,x,s)  memset(a,x,(s)*sizeof a[0])
#define mem(a,x)  memset(a,x,sizeof a)
#define ysk(x)  (1<<(x))
typedef long long ll;
typedef pair<int, int> pii;
const int INF =0x3f3f3f3f;


ll cal(ll a,ll b)
{
   if(b==0) return 0;

   return  a/b+cal(b,a%b);
}
int main()
{
   int T,kase=0;ll A,B;
   scanf("%d",&T);
//   cout<<T<<endl;
   while(T--)
   {
       scanf("%lld%lld",&A,&B);


       printf("Case #%d: ",++kase);
       if(A==0&&B==0)
       {
           puts("1");
           continue;
       }
       else if(A==0||B==0)
       {
           puts("2");
           continue;
       }
       printf("%lld\n",1+cal(A,B));

   }
   return 0;
}