Ряд Фибоначчи

(defun f (n)
            (loop
               for first = 0 then second
               and second = 1 then (+ second first)
               if (< second n) collect second into res
               else return
                 (loop 
                    for a in (nreverse res)
                    and num = n then (if (> num a) (- num a) num)
                    if (>= num a)
                    collect 1 else collect 0
                    until (= num a))))

(defun task (n &optional (res nil) (fib nil))
  (cond ((null fib)
         (let ((c 1) (p 0) (a 0) (r nil))
           (iter (for i upfrom 1) (collecting c into r) 
                                  (setq a (+ c p) p c c a)
                                  (when (> a n) (return (task n res (reverse r)))))))
        ((zerop n) (reverse res))
        ((< n (car fib)) (task n (cons 0 res) (cdr fib)))
        (t (task (- n (car fib)) (cons 1 res) (cdr fib)))))
     
==> task
 
(task 25)
 
==> (1 0 0 0 1 0 1)

;;racket
(require racket/match)
 
;;test list
(define TEST-LST '(0 1 25 1000 asdf (1 2 3 4) "asdf"))
 
;;main wraper
(define (main n) (foo n (reverse (get-fibs n)) null))
 
;;main func
(define/match (foo n lst acc . rst)
  [(_ null _ null) acc]
  [(_ _ _ null) (if (> (car lst) n)
                    (foo n (cdr lst) (append acc (list 0)))
                    (foo (- n (car lst)) (cdr lst) (append acc (list 1))))])
 
;list fibs
(define (get-fibs n)
  (if (or (not (number? n)) (< n 0)) null
      (do ([i 0 j] [j 1 (+ j i)] [acc '(0)]) ((> j n) acc)
        (set! acc (append acc (list j))))))
 
;test function
(define (test lst)
  (unless (null? lst)
    (displayln ";running tests:")
    (for ([i lst]) (printf ";returned ~a, source ~s~n" (main i) i)))
  (displayln ";have fun!"))
 
(test TEST-LST)
;running tests:
;returned (1), source 0
;returned (1 0 1), source 1
;returned (1 0 0 0 1 0 1 0 1), source 25
;returned (1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1), source 1000
;returned (), source asdf
;returned (), source (1 2 3 4)
;returned (), source "asdf"
;have fun!

;list fibs
(define (get-fibs n)
  (if (or (not (number? n)) (< n 2)) null
      (do ([i 1 j] [j 2 (+ j i)] [acc '(1)]) ((> j n) acc)
        (set! acc (append acc (list j))))))
;running tests:
;returned (), source 0
;returned (), source 1
;returned (1 0 0 0 1 0 1), source 25
;returned (1 0 0 0 0 0 0 0 0 1 0 0 0 0 0), source 1000
;returned (), source asdf
;returned (), source (1 2 3 4)
;returned (), source "asdf"
;have fun!

;racket
(require racket/match)
 
;;main wraper
(define (main n) (foo n (reverse (get-fibs n)) null))
 
;;main func
(define/match (foo n lst acc . rst)
  [(_ null _ null) acc]
  [(_ _ _ null) (if (> (car lst) n)
                    (foo n (cdr lst) (append acc (list 0)))
                    (foo (- n (car lst)) (cdr lst) (append acc (list 1))))])
 
;list fibs
(define (get-fibs n)
  (if (or (not (number? n)) (< n 2)) null
      (do ([i 1 j] [j 2 (+ j i)] [acc '(1)]) ((> j n) acc)
        (set! acc (append acc (list j))))))
 
(main 28)
;'(1 0 0 1 0 1 0)