Untitled
plain_text
2 months ago
412 B
0
Indexable
Never
#include<iostream> #include<vector> using namespace std; int fib(int n,vector<int> &dp){ if(n<=1) return n; //base case if(dp[n]!=-1) return dp[n]; //dp memorization dp[n]=fib(n-1,dp) +fib(n-2,dp); //recursion return dp[n]; } int main() { int n; cin>>n; vector<int> dp(n+1,-1); cout<< fib(n,dp); return 0; }