Fibonacci DP

PHOTO EMBED

Wed May 22 2024 08:23:51 GMT+0000 (Coordinated Universal Time)

Saved by @ayushg103 #c++

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5;
vector<int> dp(N,-1);
int fib(int n)
{
    if(n==0)return 0;
    if(n==1)return 1;
    if(dp[n]!=-1)return dp[n];
    return dp[n]=fib(n-1)+fib(n-2);
}
int main()
{
    int n=6;
    cout<<fib(n);
}
content_copyCOPY