蜜蜂路线

戏志才 · 2019-06-20 13:49:26 · 个人记录

//O-2-luogu-judger-enable

include<iostream>

include<string>

include"cstring"

include<cmath>

using namespace std;

char a[1000050],b[1000050],m,n;

int x[1000050],y[1000050];

string z[1000050]={"0","1","2","3","5","8","13","21","34"};

void change(char aa[],int bb[]){

    int len=strlen(aa);

    for(int i=0;i<=len-1;i++){

        bb[len-i]=aa[i]-'0';

    }

    bb[0]=len;

}

void add(int aa[],int bb[],string cc[]){

    int len=max(aa[0],bb[0]);
    for(int i=1;i<=len;i++){
        cc[i]=aa[i]+bb[i];
    }
    len++;
    for(int i=1;i<=len;i++){
        if((cc[i]-'0')>9)cc[i+1]=(cc[i+1]-'0')+1,cc[i]=     (cc[i+1]-'0')%10;
    }
    while(len>1 && cc[len]==0)len--;
    cc[0]=len;

}

int main(){

    cin>>m>>n;

    for(int i=9;i<=n-m;i++){
        memset(x,0,sizeof(a));
        memset(b,0,sizeof(b));
        change(a,x),change(b,y);
        add(a,b,z[i]);
    }
    cout<<c[b-a]<<endl;

    for(int i=1;i<=x[0];i++){
        cout<<x[i];
    }cout<<endl;
    for(int i=1;i<=y[0];i++){
        cout<<y[i];
    }
    return 0;

}/ 1 2 3 4 5 6 7 8 9 0 1 2 3 5 8 13 21 34/