title: Zeckendorfs Theorem Non Neighbouring Fibonacci Representation
signature: function zeckendorfsTheoremNonNeighbouringFibonacciRepresentation($n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        54, 
        34));
      
      printf("TEST-1...%s\n",driver(
        71, 
        55));
      
      printf("TEST-2...%s\n",driver(
        64, 
        55));
      
      printf("TEST-3...%s\n",driver(
        71, 
        55));
      
      printf("TEST-4...%s\n",driver(
        96, 
        89));
      
      printf("TEST-5...%s\n",driver(
        43, 
        34));
      
      printf("TEST-6...%s\n",driver(
        70, 
        55));
      
      printf("TEST-7...%s\n",driver(
        94, 
        89));
      
      printf("TEST-8...%s\n",driver(
        95, 
        89));
      
      printf("TEST-9...%s\n",driver(
        69, 
        55));
      
  }
  
  main();
  ?>
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;
  }