Fibinary Numbers UVA - 763（大数、斐波那契数、进制转换）

题目链接：Fibinary Numbers UVA - 763

题目大意：给出两个二进制数，但是这两个数从右到左的第n位的权值为斐波那契数列中对应的第n个数，这样的数称为斐波那契数，最后输出两数和的斐波那契数。例如1010代表1·5+0·3+1·2+0·1 = 7。

先把斐波那契数打表，然后进行进制转换。

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const int N=1e2+5;

struct bign
{
    int len;
    int s[1000];

    bign()
    {
        len=1;
        memset(s,0,sizeof(s));
    }

    bign operator = (const char *number)
    {
        len=strlen(number);
        for(int i=0;i<len;i++)
            s[len-i-1]=number[i]-'0';

        return *this;
    }
    bign operator = (const int number)
    {
        char string[N];
        sprintf(string,"%d",number);
        *this=string;
        return *this;
    }

    bign (int number) {*this=number;}
    bign (const char *number) {*this=number;}

    bign operator + (const bign &c)
    {
        bign sum;
        int t=0;
        sum.len=max(this->len,c.len);

        for(int i=0;i<sum.len;i++)
        {
            if(i<this->len)
                t+=this->s[i];
            if(i<c.len)
                t+=c.s[i];

            sum.s[i]=t%10;
            t/=10;
        }

        while(t)
            sum.s[sum.len++]=t%10,t/=10;

        return sum;
    }
    bign operator * (const bign &c)
    {
        bign sum,zero;
        if(*this==zero||c==zero)
            return zero;

        sum.len=this->len+c.len;
        for(int i=0;i<this->len;i++)
            for(int j=0;j<c.len;j++)
                sum.s[i+j]+=this->s[i]*c.s[j];
        for(int i=0;i<sum.len;i++)
            sum.s[i+1]+=sum.s[i]/10,sum.s[i]%=10;
        sum.len++;

        while(!sum.s[sum.len-1])
            sum.len--;

        return sum;
    }
    bign operator * (const int &num)
    {
        bign c=num;
        return *this*c;
    }
    bign operator / (const int &num)
    {
        bign ans;
        int k=0;

        ans.len=len;
        for(int i=ans.len-1;i>=0;i--)
        {
            ans.s[i]=(k*10+s[i])/num;
            k=(k*10+s[i])%num;
        }

        while(!ans.s[ans.len-1])
            ans.len--;

        return ans;
    }
    bign operator - (const bign &c)
    {
        bign ans;
        ans.len=max(this->len,c.len);

        int i;
        for(i=0;i<c.len;i++)
        {
            if(this->s[i]<c.s[i])
            {
                this->s[i]+=10;
                this->s[i+1]--;
            }
            ans.s[i]=this->s[i]-c.s[i];
        }
        for(;i<this->len;i++)
        {
            if(this->s[i]<0)
            {
                this->s[i]+=10;
                this->s[i+1]--;
            }
            ans.s[i]=this->s[i];
        }

        while(ans.s[ans.len-1]==0)
            ans.len--;
        if(ans.len==0)
            ans.len=1;

        return ans;
    }

    void put()
    {
        if(len==1&&s[0]==0)
            printf("0");
        else
            for(int i=len-1;i>=0;i--)
                printf("%d",s[i]);
        printf("\n");
    }

    bool operator < (const bign &b) const
    {
        if(len!=b.len)
            return len<b.len;

        for(int i=len-1;i>=0;i--)
            if(s[i]!=b.s[i])
                return s[i]<b.s[i];

        return false;
    }
    bool operator > (const bign &b) const {return b<*this;}
    bool operator <= (const bign &b) const {return !(b<*this);}
    bool operator >= (const bign &b) const {return !(*this<b);}
    bool operator != (const bign &b) const {return b<*this||*this<b;}
    bool operator == (const bign &b) const {return !(b!=*this);}
};

bign f[N];
bign tem=0;
char s1[N],s2[N];

bign getf(char s[])
{
    bign ans=0;

    int len=strlen(s);
    for(int i=1;i<=len;i++)
        if(s[len-i]=='1')
            ans=ans+f[i];

    return ans;
}

void print(bign n)
{
    if(n==tem)
    {
        printf("0\n");
        return ;
    }

    int i;
    for(i=1;i<N;i++)
        if(f[i]>n)
            break;

    int flag=1;
    for(i--;i;i--)
        if(f[i]<=n&&flag)
        {
            n=n-f[i];
            printf("1");
            flag=0;
        }
        else
        {
            printf("0");
            flag=1;
        }
    printf("\n");
}

int main()
{
    f[0]=f[1]=1;
    for(int i=2;i<N;i++)
        f[i]=f[i-1]+f[i-2];

    int flag=0;
    while(~scanf("%s%s",s1,s2))
    {
        if(flag)
            printf("\n");
        flag=1;

        bign n1=getf(s1);
        bign n2=getf(s2);

        print(n1+n2);
    }

    return 0;
}