POJ2116 Death to Binary?

 /*
  POJ2116 Death to Binary?
  http://poj.org/problem?id=2116
  齐肯多夫定理

  */
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <cmath>
 #include <vector>
 #include <queue>
 #include <iostream>
 #include <map>
 #include <set>
 //#define test
 using namespace std;
 const int Nmax=1e6+;
 char s[],a[],b[],c[],tmp[],t[];
 long long f[];
 vector<long long> v;
 vector<long long>::iterator it;
 long long scan()
 {
     char c=getchar();
     while(c==' '||c=='\n')
         c=getchar();
     if(c==-)
         return -;
     int sz=;
     while(c>='' && c<='')
     {
         s[++sz]=c;
         c=getchar();
     }
     long long x=0LL;
     for(int i=;i<=sz;i++)
     {
         x+=1LL*(s[i]-'')*f[sz-i];
     }
     return x;
 }
 int id(long long x)
 {
     int now=upper_bound(v.begin(),v.end(),x)-v.begin();
     if(now!=)
         now--;
     return now;
 }
 char* get(long long x)
 {
    int sz=;
    for(int i=;i<=;i++)
        tmp[i]='';
    //printf("\n");
    while(x>)
    {
        //printf("x:%lld\n",x);
        tmp[id(x)]='';
        sz=max(sz,id(x));
        //printf("%d ",id(x));
        //printf("%lld",f[id(x)]);
        x-=f[id(x)];
    }
    //printf("\n");
    //for(int i=0;i<=40;i++)
        //printf("%c",tmp[i]);
    //printf("\n");

    //printf("%s\n",tmp);

    for(int i=sz;i>=;i--)
        t[sz-i]=tmp[i];
    t[sz+]='\0';
    return t;
 }
 void print()
 {
     int n=strlen(c);
     int sum=n+;
     int an=strlen(a);
     int bn=strlen(b);
     for(int i=;i<=sum-an;i++)
         putchar(' ');
     printf("%s\n",a);
     putchar('+');
     for(int i=;i<=sum-bn-;i++)
         putchar(' ');
     printf("%s\n",b);
     putchar(' ');
     putchar(' ');
     for(int i=;i<=n;i++)
         putchar('-');
     putchar('\n');
     putchar(' ');
     putchar(' ');
     printf("%s\n\n",c);
 }
 int main()
 {
     #ifdef test
     #endif
     //freopen("poj2166.in","r",stdin);
     f[]=1LL;
     f[]=2LL;
     for(int i=;i<;i++)
         f[i]=f[i-]+f[i-];
     for(int i=;i<=;i++)
         v.push_back(f[i]);
     while()
     {
         long long x=scan();
         //printf("%lld\n",x);
         if(x==-)
             break;
         long long y=scan();
         if(y==-)
             break;
         long long ans=x+y;
         //long long ttt=40LL;
         //while(ttt>0)
         //{
             //printf("%d\n",id(ttt));
             //printf("%lld\n",f[id(ttt)]);
             //ttt-=f[id(ttt)];
         //}
         //strcpy(a,get(40LL));
         //printf("%s\n",a);
         strcpy(a,get(x));
         strcpy(b,get(y));
         strcpy(c,get(ans));
         print();
     }
     return ;
 }