title: Sum Fibonacci Numbers
signature: sum_fibonacci_numbers <- function(n) {
test_code: 
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  validate_solution <- function(actual, expected) {
      toString(actual)==toString(expected)
  }
  
  driver <- function(n, expected){
      if (validate_solution(PLACEHOLDER_FN_NAME(n), expected)){
          "PASSED"
      } else{
          "FAILED"
      }
  }
  
  main <- function() {
      cat(sprintf("TEST-0...%s\n",driver(
          9L, 
          88L
      )))
  
      cat(sprintf("TEST-1...%s\n",driver(
          50L, 
          32951280098L
      )))
  
      cat(sprintf("TEST-2...%s\n",driver(
          7L, 
          33L
      )))
  
      cat(sprintf("TEST-3...%s\n",driver(
          21L, 
          28656L
      )))
  
      cat(sprintf("TEST-4...%s\n",driver(
          21L, 
          28656L
      )))
  
      cat(sprintf("TEST-5...%s\n",driver(
          11L, 
          232L
      )))
  
      cat(sprintf("TEST-6...%s\n",driver(
          25L, 
          196417L
      )))
  
      cat(sprintf("TEST-7...%s\n",driver(
          62L, 
          10610209857722L
      )))
  
      cat(sprintf("TEST-8...%s\n",driver(
          4L, 
          7L
      )))
  
  }
  
  main()
source_py: def sum_fibonacci_numbers(n):
      if (n <= 0):
          return 0
      fibo = ([0] * (n + 1))
      fibo[1] = 1
      sm = (fibo[0] + fibo[1])
      for i in range(2, (n + 1)):
          fibo[i] = (fibo[(i - 1)] + fibo[(i - 2)])
          sm = (sm + fibo[i])
      return sm
source_cpp: int sum_fibonacci_numbers(int n) {
    if ( n <= 0 ) return 0;
    int fibo [ n + 1 ];
    fibo [ 0 ] = 0, fibo [ 1 ] = 1;
    int sum = fibo [ 0 ] + fibo [ 1 ];
    for ( int i = 2;
    i <= n;
    i ++ ) {
      fibo [ i ] = fibo [ i - 1 ] + fibo [ i - 2 ];
      sum += fibo [ i ];
    }
    return sum;
  }