title: Find Index Given Fibonacci Number Constant Time 1
signature: function find_index_given_fibonacci_number_constant_time_1(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(20, 8);
      @printf("TEST-0...%s\n",result);
      
      result = driver(95, 11);
      @printf("TEST-1...%s\n",result);
      
      result = driver(39, 9);
      @printf("TEST-2...%s\n",result);
      
      result = driver(21, 8);
      @printf("TEST-3...%s\n",result);
      
      result = driver(94, 11);
      @printf("TEST-4...%s\n",result);
      
      result = driver(79, 11);
      @printf("TEST-5...%s\n",result);
      
      result = driver(56, 10);
      @printf("TEST-6...%s\n",result);
      
      result = driver(62, 10);
      @printf("TEST-7...%s\n",result);
      
      result = driver(23, 8);
      @printf("TEST-8...%s\n",result);
      
      result = driver(3, 4);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def find_index_given_fibonacci_number_constant_time_1(n):
      fibo = ((2.078087 * math.log(n)) + 1.672276)
      return round(fibo)
source_cpp: int find_index_given_fibonacci_number_constant_time_1(int n) {
    float fibo = 2.078087 * log ( n ) + 1.672276;
    return round ( fibo );
  }