Hat's Fibonacci

最新推荐文章于 2023-10-09 02:02:27 发布

山农数学姜赫

最新推荐文章于 2023-10-09 02:02:27 发布

阅读量200

点赞数

分类专栏：数学函数

本文链接：https://blog.csdn.net/zx8225885qw/article/details/51548709

版权

数学函数专栏收录该内容

7 篇文章 0 订阅

订阅专栏

Hat's Fibonacci

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 2040 Accepted Submission(s): 795

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

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.

Author

戴帽子的

Recommend

Ignatius.L

大数相加

二维数组一个一个保留 4位

不知道为什么判断的时候直接判断不行得重新循环判断

ac代码

#include<iostream>
#include<cstring>
#include<cmath>
#include<stdio.h>
using namespace std;
int a[7250][650];
int main()
{
    memset(a,0,sizeof(a));
    a[1][0]=1;
    a[2][0]=1;
    a[3][0]=1;
    a[4][0]=1;
    int i,j;
    int p=1;
    for(i=5;i<=7200;i++)
    {
        for(j=0;j<=p;j++)
    {
        a[i][j]=a[i-1][j]+a[i-2][j]+a[i-3][j]+a[i-4][j];
    }
    for(j=0;j<=p;j++)
    {a[i][j+1]+=a[i][j]/10000;
        a[i][j]=a[i][j]%10000;
    }
    if(a[i][p])
        p++;
    }
    int n;
 while(scanf("%d",&n)!=EOF)
    {

        int i;

        for(i=p;i>=0;i--)
            if(a[n][i]!=0)
                break;
        printf("%d",a[n][i--]);
       for(;i>=0;i--)
       {
           printf("%04d",a[n][i]);
       }

        printf("\n");
    }
    return 0;
}