title: Zeckendorfs Theorem Non Neighbouring Fibonacci Representation
signature: zeckendorfsTheoremNonNeighbouringFibonacciRepresentation :: Integer -> Integer
  zeckendorfsTheoremNonNeighbouringFibonacciRepresentation n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      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) )
  
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;
  }