title: Leonardo Number 1
signature: leonardoNumber1(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          75, 
          6832909245813413)
      }");
  
      print("TEST-1...${driver(
          76, 
          11055879401769513)
      }");
  
      print("TEST-2...${driver(
          55, 
          451702867433)
      }");
  
      print("TEST-3...${driver(
          14, 
          1219)
      }");
  
      print("TEST-4...${driver(
          43, 
          1402817465)
      }");
  
      print("TEST-5...${driver(
          10, 
          177)
      }");
  
      print("TEST-6...${driver(
          16, 
          3193)
      }");
  
      print("TEST-7...${driver(
          30, 
          2692537)
      }");
  
      print("TEST-8...${driver(
          44, 
          2269806339)
      }");
  
      print("TEST-9...${driver(
          65, 
          55555780070575)
      }");
  
      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 ];
  }