（字典树）Revenge of Fibonacci -- HDU -- 4099

链接：

http://acm.hdu.edu.cn/showproblem.php?pid=4099

要用c++交哦， G++ MLE

不是很懂，先粘上慢慢学习

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;

#define N 100

struct node
{
    int ID;
    node *next[];
}*Head;

char c[], str[][];

void Add(char a[], char b[], char back[]) ///计算a+b， 结果存入c
{
    int i, j, k;
    int x, y, z;
    int up;

    i = strlen(a)-;
    j = strlen(b)-;
    k = ;
    up = ;

    while(i>= || j>=)
    {
        if(i<) x = ;
        else x = a[i]-'';

        if(j<) y = ;
        else y = b[j]-'';

        z = x+y+up;
        c[k++] = z%+'';
        up = z/;
        i--;
        j--;
    }
    if(up>) c[k++] = up+'';
    for(i=; i<k; i++)
        back[i] = c[k--i];
    back[k] = '\0';
}

void Tree_Insert(char str[], int Index)///插入单词
{
    node *t, *s = Head;
    int i;
    int len = strlen(str);

    for(i=; i<len && i<; i++)
    {
        int id = str[i]-'';
        if(s->next[id]==NULL)
        {
            t = new node();
            for(int i=;i<;i++)t->next[i]=NULL;
            t->ID = -;
            s->next[id] = t;
        }
        s = s->next[id];
        if(s->ID<) s->ID = Index;
    }
}

int Tree_Find(char str[])
{
    node *s=Head;
    int count, i;
    int len = strlen(str);

    for(i=; i<len; i++)
    {
        int id = str[i]-'';
        if(s->next[id]==NULL)
            return -;
        else
        {
            s = s->next[id];
            count = s->ID;
        }
    }
    return count;
}

void Tree_Del(node *p)
{
    for(int i=; i<; i++)
    {
        if(p->next[i]!=NULL)
            Tree_Del(p->next[i]);
    }
    free(p);
}

int main()
{
    Head = new node();
    for(int i=;i<;i++)Head->next[i]=NULL;

    Head->ID = -;
    str[][] = '';
    str[][] = ;
    Tree_Insert(str[], );

    str[][]='';
    str[][]=;
    Tree_Insert(str[], );

    for(int i=; i<; i++)
    {
        int len1 = strlen(str[]);
        int len2 = strlen(str[]);

        if(len2>)
        {
            str[][len2-]=;
            str[][len1-]=;
        }
        Add(str[], str[], str[]);

        ///  printf("%s\n",str[2]);

        Tree_Insert(str[], i);
        strcpy(str[], str[]);
        strcpy(str[], str[]);

        ///   for(int i=0;i<100;i++)str[0][i]=str[1][i];
        ///   for(int i=0;i<100;i++)str[1][i]=str[2][i];
    }

    int t, iCase=;
    char str1[];
    scanf("%d", &t);
    while(t--)
    {
        scanf("%s", str1);
        printf("Case #%d: %d\n", iCase++, Tree_Find(str1));
    }

    Tree_Del(Head);
    return ;
}