hdu4099(斐波纳契数列+字典树)

Revenge of Fibonacci

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 204800/204800 K (Java/Others)
Total Submission(s): 1176    Accepted Submission(s): 268

Problem Description

The well-known Fibonacci sequence is defined as following:


  Here we regard n as the index of the Fibonacci number F(n).
  This sequence has been studied since the publication of Fibonacci's book Liber Abaci. So far, many properties of this sequence have been introduced.
  You had been interested in this sequence, while after reading lots of papers about it. You think there’s no need to research in it anymore because of the lack of its unrevealed properties. Yesterday, you decided to study some other sequences like Lucas sequence instead.
  Fibonacci came into your dream last night. “Stupid human beings. Lots of important properties of Fibonacci sequence have not been studied by anyone, for example, from the Fibonacci number 347746739…”
  You woke up and couldn’t remember the whole number except the first few digits Fibonacci told you. You decided to write a program to find this number out in order to continue your research on Fibonacci sequence.

 

Input

  There are multiple test cases. The first line of input contains a single integer T denoting the number of test cases (T<=50000).
  For each test case, there is a single line containing one non-empty string made up of at most 40 digits. And there won’t be any unnecessary leading zeroes.

 

Output

  For each test case, output the smallest index of the smallest Fibonacci number whose decimal notation begins with the given digits. If no Fibonacci number with index smaller than 100000 satisfy that condition, output -1 instead – you think what Fibonacci wants to told you beyonds your ability.

 

Sample Input

151121231234123459989879876987658932510751761671761761763477467395610

 

Sample Output

Case #1: 0Case #2: 25Case #3: 226Case #4: 1628Case #5: 49516Case #6: 15Case #7: 15Case #8: 15Case #9: 43764Case #10: 49750Case #11: 10Case #12: 51Case #13: -1Case #14: 1233Case #15: 22374
 
本题要求以给出的字符串为前缀的斐波纳契数列的最小下表。
本题询问的数是大数，用字符形式表示，且对应的斐波纳契数列下标可达100000，也很容易加到很大，因此都必须用字符串进行大数加法。同时题目询问的大数不超过40，就是超过40位的时候就应该进行截断处理：只保留高40位，但在实际运算的时候低位可能产生进位，且可能进位是有很远的低位引起的，为了保证正确，必须在运算时保留多余40很多的。
40位一位一位比要比40次，且每次有10种（1到9），不能自己开个hash表否则超内存，又不敢用map可能超时（STL库函数虽方便但效率不高），可以自己建个字典树，最多查找40次，很大优化。
 
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;char c[100];//void add(char a[],char b[],char back[]){    int i,j,k;    int x,y,z;    int up;    i=strlen(a)-1;    j=strlen(b)-1;    k=0;    up=0;    while(i>=0||j>=0)    {        if(i<0)x=0;        else x=a[i]-'0';        if(j<0)y=0;        else y=b[j]-'0';        z=x+y+up;        c[k++]=z%10+'0';        up=z/10;        i--;        j--;    }    if(up>0)c[k++]=up+'0';    for(i=0;i<k;i++)back[i]=c[k-1-i];    back[k]='\0';}const int MAX=10;typedef struct Node{    int id;    struct Node *next[MAX];Node(){id=-1;for(int i=0;i<10;i++)next[i]=NULL;}}TrieNode;TrieNode *head;void Tree_insert(char str[],int index)//插入单词{    Node *t,*s=head;    int i,j;    int len=strlen(str);    for(i=0;i<len&&i<41;i++)    {        int id=str[i]-'0';        if(s->next[id]==NULL)        {            t=new Node;            s->next[id]=t;        }        s=s->next[id];        if(s->id<0)s->id=index;    }}int Tree_Find(char str[]){    Node *s=head;    int count,i;    int len=strlen(str);    for(i=0;i<len;i++)    {        int id=str[i]-'0';        if(s->next[id]==NULL)        {            return -1;        }        else        {            s=s->next[id];            count=s->id;        }    }    return count;}void Tree_Del(Node *p){    for(int i=0;i<10;i++)    {        if(p->next[i]!=NULL)          Tree_Del(p->next[i]);    }    delete p;}char str[3][100];int main(){int i;    head=new Node;    str[0][0]='1';    str[0][1]=0;    Tree_insert(str[0],0);//F[0]=1    str[1][0]='1';    str[1][1]=0;    Tree_insert(str[1],1);//F[1]=1    for(i=2;i<100000;i++)    {        int len1=strlen(str[0]);        int len2=strlen(str[1]);        if(len2>60)        {            str[1][len2-1]=0;            str[0][len1-1]=0;        }        add(str[0],str[1],str[2]);        Tree_insert(str[2],i);        strcpy(str[0],str[1]);        strcpy(str[1],str[2]);    }    int cas,iCase=1;    char str1[60];    scanf("%d",&cas);    while(cas--)    {        scanf("%s",&str1);        printf("Case #%d: %d\n",iCase++,Tree_Find(str1));    }    Tree_Del(head);    return 0;}