fibonacciMemoization.cpp

#include <iostream>
#include <map>

using namespace std;


int fib(int n) {
  static map<int,int> mem{{1,1}, {0,1}};  
  
  if (mem.count(n) > 0) {
    return mem[n];
  }
  
  int res = fib(n-1) + fib(n-2);
  mem[n] = res;
  
  return res;
}

int main() {  
  cout << fib(25) << endl;
  
  return 0;
}