title: Zeckendorfs Theorem Non Neighbouring Fibonacci Representation
signature: pub fn zeckendorfs_theorem_non_neighbouring_fibonacci_representation(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(
        54, 
        34
      ));
      
      println!("TEST-1...{}", driver(
        71, 
        55
      ));
      
      println!("TEST-2...{}", driver(
        64, 
        55
      ));
      
      println!("TEST-3...{}", driver(
        71, 
        55
      ));
      
      println!("TEST-4...{}", driver(
        96, 
        89
      ));
      
      println!("TEST-5...{}", driver(
        43, 
        34
      ));
      
      println!("TEST-6...{}", driver(
        70, 
        55
      ));
      
      println!("TEST-7...{}", driver(
        94, 
        89
      ));
      
      println!("TEST-8...{}", driver(
        95, 
        89
      ));
      
      println!("TEST-9...{}", driver(
        69, 
        55
      ));
      
  }
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;
  }