title: Zeckendorfs Theorem Non Neighbouring Fibonacci Representation
signature: func zeckendorfsTheoremNonNeighbouringFibonacciRepresentation(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(54, 34)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(71, 55)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(64, 55)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(71, 55)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(96, 89)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(43, 34)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(70, 55)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(94, 89)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(95, 89)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(69, 55)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }