Death to Binary? 分析模拟

/**
题目：Death to Binary?
链接：https://vjudge.net/contest/154246#problem/T
题意：略。
思路：
注意事项：
给的字符串存在前导0；
存在0+0

*/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5+;
const double eps = 1e-;
ll f[];
int la, lb, lc;
void init()
{
    f[] = ;
    f[] = ;
    for(int i = ; i < ; i++){
        f[i] = f[i-]+f[i-];
    }
}

void removeLeadZero(char a[])
{
    int len = strlen(a);
    int i = ;
    while(i<len&&a[i]==''){
        i++;
    }
    if(i==len){
        a[] = '';
        a[] = '\0';
    }else
    strcpy(a,a+i);
}
void canonical(char a[])
{
    int len = strlen(a);
    int flag = ;
    char temp[];
    int t = ;
    temp[t++] = a[];
    for(int i = ; i < len; i++){
        if(a[i]==a[i-]&&a[i]==''){
            flag = ;
            if(t!=){
                temp[t-] = '';
                t--;
            }
            temp[t++] = '';
            temp[t++] = '';
            i++;
            while(i<len){
                temp[t++] = a[i++];
            }
            break;
        }else
        {
            temp[t++] = a[i];
        }
    }
    temp[t] = '\0';
    if(flag) canonical(temp);
    strcpy(a,temp);
}
void getC(ll x,char c[])
{
    lc = ;
    int pos;
    for(int i = ; i < ; i++){
        if(f[i]>x){
            pos = i;
            break;
        }
    }
    pos = pos-;
    while(pos>=){
        if(f[pos]<=x){
            c[lc++] = '';
            x -= f[pos];
        }else
        {
            c[lc++] = '';
        }
        pos--;
    }
    if(lc==){
        c[lc++] = '';
    }
    c[lc] = '\0';
}
void print(char a[],char b[],char c[])
{
    canonical(a);
    canonical(b);
    canonical(c);
    //printf("a = %s b = %s c = %s\n",a,b,c);
    lc = strlen(c);
    la = strlen(a);
    lb = strlen(b);
    int sp = +lc-la;
    while(sp--){
        printf(" ");
    }
    printf("%s\n",a);
    printf("+");
    sp = +lc-lb-;
    while(sp--){
        printf(" ");
    }
    printf("%s\n",b);
    printf("  ");
    sp = lc;
    while(sp--){
        printf("-");
    }
    printf("\n");
    printf("  ");
    printf("%s\n\n",c);
}
int main()
{
    char a[], b[], c[];
    init();
    while(scanf("%s%s",a,b)==)
    {
        removeLeadZero(a);
        removeLeadZero(b);
        //printf("a = %s\n",a);
        //printf("b = %s\n",b);
        ll sa, sb, sc;
        sa = sb = ;
        la = strlen(a);
        lb = strlen(b);
        for(int i = la-; i >= ; i--){
            if(a[i]==''){
                sa += f[la--i];
            }
        }
        for(int i = lb-; i >= ; i--){
            if(b[i]==''){
                sb += f[lb--i];
            }
        }

        sc = sa+sb;
        getC(sc,c);
        //printf("a = %s\n",a);
        //printf("c = %s\n",c);
        //printf("sa = %lld    sb = %lld\n",sa,sb);
        print(a,b,c);
    }
    return ;
}