title: Zeckendorfs Theorem Non Neighbouring Fibonacci Representation
signature: function zeckendorfs_theorem_non_neighbouring_fibonacci_representation(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(54, 34);
      @printf("TEST-0...%s\n",result);
      
      result = driver(71, 55);
      @printf("TEST-1...%s\n",result);
      
      result = driver(64, 55);
      @printf("TEST-2...%s\n",result);
      
      result = driver(71, 55);
      @printf("TEST-3...%s\n",result);
      
      result = driver(96, 89);
      @printf("TEST-4...%s\n",result);
      
      result = driver(43, 34);
      @printf("TEST-5...%s\n",result);
      
      result = driver(70, 55);
      @printf("TEST-6...%s\n",result);
      
      result = driver(94, 89);
      @printf("TEST-7...%s\n",result);
      
      result = driver(95, 89);
      @printf("TEST-8...%s\n",result);
      
      result = driver(69, 55);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def zeckendorfs_theorem_non_neighbouring_fibonacci_representation(n):
      if ((n == 0) or (n == 1)):
          return n
      (f1, f2, f3) = (0, 1, 1)
      while (f3 <= n):
          f1 = f2
          f2 = f3
          f3 = (f1 + f2)
      return f2
source_cpp: int zeckendorfs_theorem_non_neighbouring_fibonacci_representation(int n) {
    if ( n == 0 || n == 1 ) return n;
    int f1 = 0, f2 = 1, f3 = 1;
    while ( f3 <= n ) {
      f1 = f2;
      f2 = f3;
      f3 = f1 + f2;
    }
    return f2;
  }