UVa Mobile Casanova

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
    int c=1,g,x,t,m,n,d,k,l;
    while(scanf("%d",&t)&&t){
        ll wq[t+3];
        for(g=0;g<t;g++)scanf("%lld",&wq[g]);
        printf("Case %d:\n",c++);
        for(g=1;g<t;g++){
            x=g-1;
            while(wq[g-1]+1==wq[g]&&g<t)g++;
            if(g-1==x)printf("0%lld\n",wq[x]);
            else{
                printf("0%lld-",wq[x]);
                m=0,n=-1,d=10,k=wq[g-1],l=wq[x];
                while(1){
                    m=wq[g-1]%d;
                    n=wq[x]%d;
                    k/=10;
                    l/=10;
                    if(k==l)break;
                    d*=10;
                }
                printf("%d\n",m);
            }
        }
        if(wq[t-1]!=wq[t-2]+1)printf("0%lld\n",wq[t-1]);
        if(c>1)printf("\n");
    }
    return 0;
}