title: Leonardo Number 1
signature: long long leonardoNumber1(int n) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(long long actual, long long expected){
      return actual == expected;
  }
  
  string driver(int n, long long expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(75, 6832909245813413); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(76, 11055879401769513); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(55, 451702867433); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(14, 1219); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(43, 1402817465); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(10, 177); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(16, 3193); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(30, 2692537); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(44, 2269806339); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(65, 55555780070575); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def leonardo_number_1(n):
      dp = []
      dp.append(1)
      dp.append(1)
      for i in range(2, (n + 1)):
          dp.append(((dp[(i - 1)] + dp[(i - 2)]) + 1))
      return dp[n]
source_cpp: int leonardo_number_1(int n) {
    int dp [ n + 1 ];
    dp [ 0 ] = dp [ 1 ] = 1;
    for ( int i = 2;
    i <= n;
    i ++ ) dp [ i ] = dp [ i - 1 ] + dp [ i - 2 ] + 1;
    return dp [ n ];
  }