bzoj 3978: [WF2012]Fibonacci Words

#include<bits/stdc++.h>
int n;
char s[100007],Fl[107][100007],Fr[107][100007];
int ls[107],ks=0;
long long f[107];
int main(){
    Fl[0][0]=Fr[0][0]=‘0‘;
    Fl[1][0]=Fr[1][0]=‘1‘;
    ls[0]=ls[1]=1;
    for(int i=2;i<=100;++i){
        ls[i]=ls[i-1]+ls[i-2];
        if(ls[i]>100000)ls[i]=100000;
        for(int j=0;j<ls[i];++j){
            Fl[i][j]=(j<ls[i-1]?Fl[i-1][j]:Fl[i-2][j-ls[i-1]]);
            Fr[i][j]=(j<ls[i-2]?Fr[i-2][j]:Fr[i-1][j-ls[i-2]]);
        }
    }
    while(scanf("%d",&n)==1){
        scanf("%s",s);
        int len=strlen(s);
        f[0]=f[1]=0;
        if(len==1)f[s[0]-‘0‘]=1;
        for(int i=2;i<=n;++i){
            f[i]=f[i-1]+f[i-2];
            for(int j=1;j<len;++j)if(j<=ls[i-1]&&len-j<=ls[i-2]){
                for(int k=0;k<len;++k)if(s[k]!=(k<j?Fr[i-1][j-1-k]:Fl[i-2][k-j]))goto o;
                ++f[i];
                o:;
            }
        }
        printf("Case %d: %lld\n",++ks,f[n]);
    }
    return 0;
}