title: Find Index Given Fibonacci Number Constant Time 1
signature: findIndexGivenFibonacciNumberConstantTime1(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          20, 
          8)
      }");
  
      print("TEST-1...${driver(
          95, 
          11)
      }");
  
      print("TEST-2...${driver(
          39, 
          9)
      }");
  
      print("TEST-3...${driver(
          21, 
          8)
      }");
  
      print("TEST-4...${driver(
          94, 
          11)
      }");
  
      print("TEST-5...${driver(
          79, 
          11)
      }");
  
      print("TEST-6...${driver(
          56, 
          10)
      }");
  
      print("TEST-7...${driver(
          62, 
          10)
      }");
  
      print("TEST-8...${driver(
          23, 
          8)
      }");
  
      print("TEST-9...${driver(
          3, 
          4)
      }");
  
      return 0;
  }
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 );
  }