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+7;
char s[50],a[50],b[50],c[50],tmp[50],t[50];
long long f[50];
vector<long long> v;
vector<long long>::iterator it;
long long scan()
{
    char c=getchar();   
    while(c==' '||c=='
')
        c=getchar();
    if(c==-1)
        return -1;
    int sz=0;
    while(c>='0' && c<='1')
    {
        s[++sz]=c;
        c=getchar();
    }
    long long x=0LL;
    for(int i=1;i<=sz;i++)
    {
        x+=1LL*(s[i]-'0')*f[sz-i];
    }
    return x;
}
int id(long long x)
{
    int now=upper_bound(v.begin(),v.end(),x)-v.begin();
    if(now!=0)
        now--;
    return now;
}
char* get(long long x)
{
   int sz=0;
   for(int i=0;i<=40;i++)
       tmp[i]='0';
   //printf("
");
   while(x>0)
   {
       //printf("x:%lld
",x);
       tmp[id(x)]='1';
       sz=max(sz,id(x));
       //printf("%d ",id(x));
       //printf("%lld",f[id(x)]);
       x-=f[id(x)];
   }
   //printf("
");
   //for(int i=0;i<=40;i++)
       //printf("%c",tmp[i]);
   //printf("
");
   
   //printf("%s
",tmp);
 
   for(int i=sz;i>=0;i--)
       t[sz-i]=tmp[i];
   t[sz+1]='';
   return t;
}
void print()
{
    int n=strlen(c);
    int sum=n+2;
    int an=strlen(a);
    int bn=strlen(b);
    for(int i=1;i<=sum-an;i++)
        putchar(' ');
    printf("%s
",a);
    putchar('+');
    for(int i=1;i<=sum-bn-1;i++)
        putchar(' ');
    printf("%s
",b);
    putchar(' ');
    putchar(' ');
    for(int i=1;i<=n;i++)
        putchar('-');
    putchar('
');
    putchar(' ');
    putchar(' ');
    printf("%s

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