UVA 763 Fibinary Numbers

题意讲某个二进制按照规则每一位对应斐波那契数生成新的数字，然后2个数字求和。再求由该规则生成的二进制串。并且要求尽量用更大项的fib数（题目提示不能由连续的1就是2个连续的1（11）不如100更优）

用大数处理出100项fib。然后模拟交替置位位0或者1，输出

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b) {return a % b ==  ? b : gcd(b, a % b);}
const int  numlen=;
struct bign {
    int len, s[numlen];
    bign() {
        memset(s, , sizeof(s));
        len = ;
    }
    bign(int num) { *this = num; }
    bign(const char *num) { *this = num; }
    bign operator = (const int num) {
        char s[numlen];
        sprintf(s, "%d", num);
        *this = s;
        return *this;
    }
    bign operator = (const char *num) {
        len = strlen(num);
        while(len >  && num[] == '') num++, len--;
        for(int i = ;i < len; i++) s[i] = num[len-i-] - '';
        return *this;
    }

    void deal() {
        while(len >  && !s[len-]) len--;
    }

    bign operator + (const bign &a) const {
        bign ret;
        ret.len = ;
        int top = max(len, a.len) , add = ;
        for(int i = ;add || i < top; i++) {
            int now = add;
            if(i < len) now += s[i];
            if(i < a.len)   now += a.s[i];
            ret.s[ret.len++] = now%;
            add = now/;
        }
        return ret;
    }
    bign operator - (const bign &a) const {
        bign ret;
        ret.len = ;
        int cal = ;
        for(int i = ;i < len; i++) {
            int now = s[i] - cal;
            if(i < a.len)   now -= a.s[i];
            if(now >= )    cal = ;
            else {
                cal = ; now += ;
            }
            ret.s[ret.len++] = now;
        }
        ret.deal();
        return ret;
    }
    bign operator * (const bign &a) const {
        bign ret;
        ret.len = len + a.len;
        for(int i = ;i < len; i++) {
            for(int j = ;j < a.len; j++)
                ret.s[i+j] += s[i]*a.s[j];
        }
        for(int i = ;i < ret.len; i++) {
            ret.s[i+] += ret.s[i]/;
            ret.s[i] %= ;
        }
        ret.deal();
        return ret;
    }

    bign operator * (const int num) {
//        printf("num = %d\n", num);
        bign ret;
        ret.len = ;
        int bb = ;
        for(int i = ;i < len; i++) {
            int now = bb + s[i]*num;
            ret.s[ret.len++] = now%;
            bb = now/;
        }
        while(bb) {
            ret.s[ret.len++] = bb % ;
            bb /= ;
        }
        ret.deal();
        return ret;
    }

    bign operator / (const bign &a) const {
        bign ret, cur = ;
        ret.len = len;
        for(int i = len-;i >= ; i--) {
            cur = cur*;
            cur.s[] = s[i];
            while(cur >= a) {
                cur -= a;
                ret.s[i]++;
            }
        }
        ret.deal();
        return ret;
    }

    bign operator % (const bign &a) const {
        bign b = *this / a;
        return *this - b*a;
    }

    bign operator += (const bign &a) { *this = *this + a; return *this; }
    bign operator -= (const bign &a) { *this = *this - a; return *this; }
    bign operator *= (const bign &a) { *this = *this * a; return *this; }
    bign operator /= (const bign &a) { *this = *this / a; return *this; }
    bign operator %= (const bign &a) { *this = *this % a; return *this; }

    bool operator < (const bign &a) const {
        if(len != a.len)    return len < a.len;
        for(int i = len-;i >= ; i--) if(s[i] != a.s[i])
            return s[i] < a.s[i];
        return false;
    }
    bool operator > (const bign &a) const  { return a < *this; }
    bool operator <= (const bign &a) const { return !(*this > a); }
    bool operator >= (const bign &a) const { return !(*this < a); }
    bool operator == (const bign &a) const { return !(*this > a || *this < a); }
    bool operator != (const bign &a) const { return *this > a || *this < a; }

    string str() const {
        string ret = "";
        for(int i = ;i < len; i++) ret = char(s[i] + '') + ret;
        return ret;
    }
};
istream& operator >> (istream &in, bign &x) {
    string s;
    in >> s;
    x = s.c_str();
    return in;
}
ostream& operator << (ostream &out, const bign &x) {
    out << x.str();
    return out;
}
char a[numlen],b[numlen];
bign fib[numlen];
void init()
{
    fib[]=;fib[]=;  fib[]=;
    for (int i=;i<numlen;i++) fib[i]=fib[i-]+fib[i-];
}
bign trans(char *a)
{
    bign sum=;
    int len=strlen(a);
    for (int i=;i<=len;i++)
        if (a[i-]=='')
        sum+=fib[len-i+];
    //cout<<sum<<endl;
    return sum;
}
bign tmp;
void slove(bign sum)
{
    if (sum==tmp) {puts("");return ;}
    int i=;
    for (i=;i<numlen;i++)
       if (fib[i]>sum) break;
    i--;
    bool flag=true;
    for (;i>;i--)
    {
        //cout<<sum<<' '<<fib[i]<<endl;
        if (fib[i]<=sum && flag)
        {
            printf("");
            sum=sum-fib[i];
            flag=false;
        }
        else
        {
            printf("");
            flag=true;
        }
    }
    putchar('\n');
}
int main()
{
    init();
    bool first=false;
    while (scanf("%s%s",a,b)!=EOF)
    {
        if (first) putchar('\n');
        else first=true;
        tmp=;
        bign num1=trans(a);
        bign num2=trans(b);
        bign sum=num1+num2;
        //cout<<sum<<endl;
        //for (int i=1;i<=10;i++) cout<<fib[i]<<' ';cout<<endl;
        slove(sum);
    }
    return ;
}