title: Leonardo Number 1
signature: fun leonardoNumber1(n: Int): Long {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Long, expected:Long):Boolean{
    return actual.equals(expected)
  }
  fun driver(n: Int, expected:Long):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(75, 6832909245813413)
      println("TEST-0...${result}")
      
      result = driver(76, 11055879401769513)
      println("TEST-1...${result}")
      
      result = driver(55, 451702867433)
      println("TEST-2...${result}")
      
      result = driver(14, 1219)
      println("TEST-3...${result}")
      
      result = driver(43, 1402817465)
      println("TEST-4...${result}")
      
      result = driver(10, 177)
      println("TEST-5...${result}")
      
      result = driver(16, 3193)
      println("TEST-6...${result}")
      
      result = driver(30, 2692537)
      println("TEST-7...${result}")
      
      result = driver(44, 2269806339)
      println("TEST-8...${result}")
      
      result = driver(65, 55555780070575)
      println("TEST-9...${result}")
      
          
  }
  
  main()
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 ];
  }