title: Leonardo Number 1
signature: pub fn leonardo_number_1(n: i32) -> i64 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i64, expected: i64)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i64)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        75, 
        6832909245813413
      ));
      
      println!("TEST-1...{}", driver(
        76, 
        11055879401769513
      ));
      
      println!("TEST-2...{}", driver(
        55, 
        451702867433
      ));
      
      println!("TEST-3...{}", driver(
        14, 
        1219
      ));
      
      println!("TEST-4...{}", driver(
        43, 
        1402817465
      ));
      
      println!("TEST-5...{}", driver(
        10, 
        177
      ));
      
      println!("TEST-6...{}", driver(
        16, 
        3193
      ));
      
      println!("TEST-7...{}", driver(
        30, 
        2692537
      ));
      
      println!("TEST-8...{}", driver(
        44, 
        2269806339
      ));
      
      println!("TEST-9...{}", driver(
        65, 
        55555780070575
      ));
      
  }
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 ];
  }