title: Zeckendorfs Theorem Non Neighbouring Fibonacci Representation
signature: int zeckendorfsTheoremNonNeighbouringFibonacciRepresentation(int n) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(54, 34); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(71, 55); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(64, 55); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(71, 55); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(96, 89); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(43, 34); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(70, 55); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(94, 89); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(95, 89); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(69, 55); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
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;
  }