D - Hat‘s Fibonacci

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
4203968145672990846840663646

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

题解：
我们都清楚一点，平时模拟大数加法的时候，我们都是数组的1个单元表示数的一位，比如说1314，我们或许就开了s[4]的数组，每一下标地址存储1314的一位，其实，我们完全可以只开s[1]的数组，存取1314的四位，这样就节省了3/4的空间，当然，你也可以存5位或者6位等等
在此题目中如果一个单元存一位数的话，所用的空间难免会很大，比如当n取到7060时，就要把数组至少开到7061*2012的长度
当一个单元存四位或五位以上的数时，就要考虑到前导0的情况
当位数不足一个单位所存的位数的时候就不需要前导0，当位数满足的时候，就需要前导0的存在；

这种方法是通过牺牲空间来节省时间的一种方法
还有一种方法是
对于给出的n，每次都从第5项开始重新计算，这样做节省了空间，但是时间复杂度就比较高了，几百MS应该是要的吧。

代码：（附带一个7060的测试样例，可以输入7060看看能不能得出一样的结果）

#include <iostream>
#include <cstring>
#include <cstdio>

using namespace std;

int a[10001][555];

int main(){
    memset(a,0,sizeof(a));
    a[0][0]=1;
    a[1][0]=1;
    a[2][0]=1;
    a[3][0]=1;
    int flagi=0;
    for(int i=4;i<10000;i++){
        flagi=0;
        for(int j=0;j<555;j++){
            int sum=a[i-1][j]+a[i-2][j]+a[i-3][j]+a[i-4][j]+flagi;
            if(sum>39999){
                flagi=4;
            }
            else if(sum>29999){
                flagi=3;
            }
            else if(sum>19999){
                flagi=2;
            }
            else if(sum>9999){
                flagi=1;
            }
            else{
                flagi=0;
            }
            //cout<<"zjbl "<<sum<<endl;
            a[i][j]=sum%10000;
        }

    }
    int n;
    while(cin>>n){
        int flagflag=0;
        int flag=0;
        for(int i=0;i<10000;i++){
            if(n==i+1){
                for(int j=554;j>=0;j--){
                    if(a[i][j]!=0){
                        flag=1;
                        flagflag++;
                        if(flagflag>=4){
                            flagflag--;
                        }
                    }
                    if(flag==1&&flagflag!=1){
                        printf("%04d",a[i][j]);//一定不要忘记满足四位数的时候输出前导零，不满足四位数，则不用输出前导零
                    }
                    else if(flag==1&&flagflag==1){
                        printf("%d",a[i][j]);
                    }
                }
                cout<<endl;
                break;
            }
        }
    }
    //第100项:4203968145672990846840663646
    return 0;
}
/*第7060项:
1913281565624926851849088419089884815000161726234710227371014315075635431582946988847950985288980105057039503079904273
5599111306
6491122516724570764666509624986308294377437874961126285317553051951158244305669972596410827447207363732875279197475757
0026015847341766510940522692031965277727746517558546447769674192261041572056263739100066708278586691412486995472060584
6206351934256829531337834907474790842402939533274168300465378314603690508388596785309644903523761912630349267978975515
6470651258643824281173527611639371393562242630204862409235947343742619801405487317524559028811336352647375079244348109
4511543331362001689003923609598494005727449396477926447775388373519343833711532880606091431142906444637455442690240169
1918403227167000416965835533574488228673331213305584089827205822198178813616407932298992968043206307140383955468912432
1214067752740335539638701864698716764040481614021290977489414374608524133340881096743292068466763214657777325692142380
6495088601206226887320649375319063478900479961155680063720322751272310585679553081651309158372553882485937629354270887
5845281047618923884839453333724411835902641527124883119228499146282120886161631896324333116263087312981248089803618917
4818537885155675913091757951412487761027958912341972358625366012353990473691238307297123938463513321137380843794565938
8350419248894732348912823986118167043048972415148609370203137325604406396982348599333268513372188678474666198643021389
1375782817130484592345089812001975466681122284637215311187205376701799534964335815653819205997139763191833257419798477
9628991898562005845552532136741484339042176042497418350393210365381359887144612827918377589431441392983728506877034819
9571011423418780879072551707907675885822646091258112480910093711113655033660338564270679989394065842271636649649575073
8210734489036386052479471041621146201924331588144572267285937979746436701951413929888154167243166012017529783432709278
881378267793177030592421107611791666043469274080669610510569035691019602251413731655081987038208970322896071458782
*/

我朋友的代码，写的更加易懂一点：

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

int f[10000][555];
int main()
{
    f[1][0]=f[2][0]=f[3][0]=f[4][0]=1;
    for(int i=5; i<10000; i++)
    {
        for(int j=0; j<=505; j++)
        {
            f[i][j]=f[i-1][j]+f[i-2][j]+f[i-3][j]+f[i-4][j];
        }
        int m=0;
        for(int j=0; j<555; j++)
        {
            int sum=f[i][j]+m;
            m=sum/10000;
            f[i][j]=sum%10000;
        }
    }
    int n,flag=0;
    while(~scanf("%d",&n))
    {
        for(int i=554; i>=0; i--)
        {
            if(f[n][i]==0)
                continue;
            else
            {
                printf("%d",f[n][i]);
                flag=i;
                break;
            }
        }
        for(int i=flag-1; i>=0; i--)
        {
            printf("%04d",f[n][i]);
        }
        cout<<endl;
    }
    return 0;
}