title: Find Index Given Fibonacci Number Constant Time 1
signature: pub fn find_index_given_fibonacci_number_constant_time_1(n: i32) -> i32 {
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: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        20, 
        8
      ));
      
      println!("TEST-1...{}", driver(
        95, 
        11
      ));
      
      println!("TEST-2...{}", driver(
        39, 
        9
      ));
      
      println!("TEST-3...{}", driver(
        21, 
        8
      ));
      
      println!("TEST-4...{}", driver(
        94, 
        11
      ));
      
      println!("TEST-5...{}", driver(
        79, 
        11
      ));
      
      println!("TEST-6...{}", driver(
        56, 
        10
      ));
      
      println!("TEST-7...{}", driver(
        62, 
        10
      ));
      
      println!("TEST-8...{}", driver(
        23, 
        8
      ));
      
      println!("TEST-9...{}", driver(
        3, 
        4
      ));
      
  }
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 );
  }