考研机试题：Fibonacci

描述

The Fibonacci Numbers{0,1,1,2,3,5,8,13,21,34,55...} are defined by the recurrence:     F0=0 F1=1 Fn=Fn-1+Fn-2,n>=2     Write a program to calculate the Fibonacci Numbers.

输入描述:

 Each case contains a number n and you are expected to calculate Fn.(0<=n<=30) 。

输出描述:

  For each case, print a number Fn on a separate line,which means the nth Fibonacci Number.

输入

1

输出

1

代码

    #define _CRT_SECURE_NO_WARNINGS
    #include <stdio.h>
    using namespace std;
    int main() {
        int dp[10001] = {1,1,2};
        int n;
        scanf("%d", &n);
        for (int i = 3; i <= n; ++i) {
            dp[i] = (dp[i - 1] + dp[i-2]) % 999983;
        }
        printf("%d\n", dp[n]);
        return 0;
    }