UVA 12333 大数，字典树

题意：给一个数字，看他最小是第几个菲波那切数列的前缀。

分析：

大数模板就是吊哦。

将菲波那切数列前500个数字放到字典树上。注意插入的时候不能像普通一样，只在尾节点处标记，而是一路标记下去。

#include <bits/stdc++.h>

using namespace std;

const int NV = ;
const int ra = ;
int ten[] = {,ra,ra*ra,ra*ra*ra};
int radix = ra*ra*ra*ra;

struct integer
{
    int d[NV];
    integer()
    {
        *this=integer();
    }
    integer(int x)
    {
        for (int i=; i<NV; i++) d[i]=;
        if (!x) d[]=;
        while(x)
        {
            d[++d[]]=x%radix;
            x/=radix;
        }
    }
    integer(long long x)
    {
        for (int i=; i<NV; i++) d[i]=;
        if (!x) d[]=;
        while(x)
        {
            d[++d[]]=x%radix;
            x/=radix;
        }
    }
    integer(const char s[])
    {
        int len=strlen(s),i,j,k;
        d[]=(len-)/+;
        for (i=; i<NV; i++) d[i]=;
        for (i=len-; i>=; i--)
        {
            j=(len-i-)/+;
            k=(len-i-)%;
            d[j]+=ten[k]*(s[i]-'');
        }
        while(d[]>&&d[d[]]==) d[]--;
    }

    string tostring()
    {
        string s;
        int i,j,temp;
        for (i=; i>=; i--) if (d[d[]]>=ten[i]) break;
        temp=d[d[]];
        int cnt=;
        for (j=i; j>=; j--)
        {
            s+=(char) (temp/ten[j]+'');
            if(cnt++>)return s;
            temp%=ten[j];
        }
        for (i=d[]-; i>; i--)
        {
            temp=d[i];
            for (j=; j>=; j--)
            {
                s+=(char) (temp/ten[j]+'');
                if(cnt++>)return s;
                temp%=ten[j];
            }
        }
        return s;
    }

    void output()
    {
        int k=d[];
        printf("%d",d[k--]);
        while(k) printf("%04d",d[k--]);
        putchar('\n');
    }
} d,mid1[];

bool operator <(const integer &a,const integer &b)
{
    if (a.d[]!=b.d[]) return a.d[]<b.d[];
    for (int i=a.d[]; i>; i--)
        if (a.d[i]!=b.d[i])
            return a.d[i]<b.d[i];
    return ;
}

integer operator +(const integer &a,const integer &b)
{
    integer c;
    c.d[]=max(a.d[],b.d[]);
    int i,x=;
    for (i=; i<=c.d[]; i++)
    {
        x+=a.d[i]+b.d[i];
        c.d[i]=x%radix;
        x/=radix;
    }
    while(x)
    {
        c.d[++c.d[]]=x%radix;
        x/=radix;
    }
    return c;
}
integer operator -(const integer &a,const integer &b)
{
    integer c;
    c.d[]=a.d[];
    int i,x=;
    for (i=; i<=c.d[]; i++)
    {
        x+=radix+a.d[i]-b.d[i];
        c.d[i]=x%radix;
        x=x/radix-;
    }
    while(c.d[]>&&c.d[c.d[]]==) c.d[]--;
    return c;
}
integer operator *(const integer &a,const integer &b)
{
    integer c;
    c.d[]=a.d[]+b.d[];
    int i,j,x=;
    for (i=; i<=a.d[]; i++)
    {
        x=;
        for (j=; j<=b.d[]; j++)
        {
            x=a.d[i]*b.d[j]+x+c.d[i+j-];
            c.d[i+j-]=x%radix;
            x/=radix;
        }
        c.d[i+b.d[]]=x;
    }
    while(c.d[]>&&c.d[c.d[]]==) c.d[]--;
    return c;
}

integer operator *(const integer &a,const long long &k)
{
    integer c;
    c.d[]=a.d[];
    int i;
    long long x=;
    for (i=; i<=a.d[]; i++)
    {
        x+=a.d[i]*k;
        c.d[i]=x%radix;
        x/=radix;
    }
    while(x>)
    {
        c.d[++c.d[]]=x%radix;
        x/=radix;
    }
    while(c.d[]>&&c.d[c.d[]]==) c.d[]--;
    return c;
}
long long rem;
integer operator /(const integer &a,const long long &k)
{
    integer c;
    c.d[]=a.d[];
    long long x=;
    for (int i=a.d[]; i>=; i--)
    {
        x+=a.d[i];
        c.d[i]=x/k;
        x%=k;
        rem=x;
        x*=radix;
    }
    while(c.d[]>&&c.d[c.d[]]==) c.d[]--;
    return c;
}

bool smaller(const integer &a,const integer &b,int delta)
{
    if (a.d[]+delta!=b.d[]) return a.d[]+delta<b.d[];
    for (int i=a.d[]; i>; i--)
        if (a.d[i]!=b.d[i+delta])
            return a.d[i]<b.d[i+delta];
    return ;
}

void Minus(integer &a,const integer &b,int delta)
{
    int i,x=;
    for (i=; i<=a.d[]-delta; i++)
    {
        x+=radix+a.d[i+delta]-b.d[i];
        a.d[i+delta]=x%radix;
        x=x/radix-;
    }
    while(a.d[]>&&a.d[a.d[]]==) a.d[]--;
}

integer operator /(const integer &a,const integer &b)
{
    integer c;
    d=a;
    int i,j,temp;
    mid1[]=b;
    for (i=; i<=; i++) mid1[i]=mid1[i-]*;
    for (i=a.d[]-b.d[]; i>=; i--)
    {
        temp=;
        for (j=; j>=; j--)
        {
            if (smaller(mid1[j],d,i))
            {
                Minus(d,mid1[j],i);
                c.d[i+]+=temp;
            }
            temp/=;
        }
    }
    c.d[]=max(,a.d[]-b.d[]+);
    while(c.d[]>&&c.d[c.d[]]==) c.d[]--;
    return c;
}

bool operator ==(const integer &a,const integer &b)
{
    if (a.d[]!=b.d[]) return ;
    for (int i=; i<=a.d[]; i++)
        if (a.d[i]!=b.d[i])
            return ;
    return ;
}

const int maxnode = +;
const int sigma_size = ;

struct Trie {
    int ch[maxnode][sigma_size];
    int val[maxnode];

    int sz;
    Trie() {sz=;memset(ch[],,sizeof(ch[]));memset(val,,sizeof(val));}
    int idx(char c) {return c - '';}

    void insert(char *s, int v) {
        int u = , n = strlen(s);
        for (int i = ; i < n; i++) {
            if(val[u]==) val[u]=v;
            int c = idx(s[i]);
            if (!ch[u][c]) {
                memset(ch[sz], , sizeof(ch[sz]));
                ch[u][c] = sz++;
            }
            u = ch[u][c];

        }
        if(val[u]==)  val[u] = v;
    }

    int values(char* s) {
        int u = ,n = strlen(s);
        for(int i=;i<n;i++) {
            int c = idx(s[i]);
            if(!ch[u][c]) return -;
            u = ch[u][c];
        }
        //printf("%d\n",val[u]);
        return val[u];

    }

}sol;

void init() {
    integer a = ,b = ;
    char qwq[] = "";
    sol.insert(qwq,);
    for(int i=;i<;i++) {
        if(i%) {
            a = a+b;
            strcpy(qwq,a.tostring().c_str());
        }
        else {
            b = a+b;
            strcpy(qwq,b.tostring().c_str());
        }
        sol.insert(qwq,i);
    }
}

int main()
{
    //freopen("in.txt","r",stdin);
    init();
    int t;
    scanf("%d",&t);

    int kase = ;
    char st[];
    while(t--) {
        scanf("%s",st);
        int ans = sol.values(st);
        if(ans==) ans =;
        printf("Case #%d: %d\n",kase++,ans);

    }
    return ;
}