HDU 1250 Hat's Fibonacci （递推、大数加法、string）

Hat's Fibonacci

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14776    Accepted Submission(s): 4923

 

Problem Description

A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.
F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-3) + F(n-4)
Your task is to take a number as input, and print that Fibonacci number.

Input

Each line will contain an integers. Process to end of file.

Output

For each case, output the result in a line.

Sample Input

100

Sample Output

Note:
No generated Fibonacci number in excess of  digits will be in the test data, ie. F() =  has  digits.

问题大意与分析

就是一个变种的斐波那契，在处理大数相加的时候我用了string 被bug绊了好久...明天好好学学string

#include<bits/stdc++.h>

using namespace std;

int n,i;
string bigadd(string a,string b)
{
    int jin=,i;
    char ai,bi;
    string anss=a;
    int lena=a.size();
    int lenb=b.size();
    int lenmax=max(lena,lenb);
    int p=lena-;
    int q=lenb-;
    for(i=lenmax-;i>=;i--)
    {
        if(p<)
        ai='';
        else
        ai=a[p];
        if(q<)
        bi='';
        else
        bi=b[q];
        anss[i]=((ai-''+bi-''+jin)%)+'';
        jin=(ai-''+bi-''+jin)/;
        p--;
        q--;
    }
    if(jin)
    {
        char x=jin+'';
        anss=x+anss;
    }
    return anss;
}
/*
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        string a="1";
        string b="1";
        string c="1";
        string d="1";
        for(i=5;i<=n;i++)
        {
            string temp=d;
            d=bigadd(bigadd(a,b),bigadd(c,d));
            a=b;
            b=c;
            c=temp;
        }
        cout<<a <<b <<c <<d<<endl;
    }
 } */
 int main(){
    string a[];    //我之前用了4个string 出错了 好像是和长度有关
    a[]="";
    a[]="";
    a[]="";
    a[]="";
    for(i=;i<;++i)
           a[i]=bigadd(bigadd(bigadd(a[i-],a[i-]),a[i-]),a[i-]);
    while(scanf("%d",&n)!=EOF)
    {
        cout<<a[n]<<endl;
    }
    return ;
}