1
2
3
4
5
6
7
8
9
(defun compute/cc (x)
  (cond ((zerop x) 0)
        (t (+ (compute/cc (1- x))
              1))))
 
(defun run/cc ()
  (call/cc (compute/cc 10000000)))
 
(print (run/cc))

1
2
3
4
5
6
7
8
9
(defun compute/cc (x)
  (cond ((zerop x) 0)
        (t (+ (compute/cc (1- x))
              1))))
 
(defun run/cc ()
  (with-call/cc (compute/cc 10000000)))
 
(print (run/cc))

1
2
3
4
5
6
7
8
9
(defun/cc compute/cc (x)
  (cond ((zerop x) 0)
        (t (+ (compute/cc (1- x))
              1))))
 
(defun run/cc ()
  (with-call/cc (compute/cc 10000000)))
 
(print (run/cc))

1
2
3
4
5
6
7
8
9
(defun/cc compute/cc (x)
  (cond ((zerop x) 0)
        (t (+ (compute/cc (1- x))
              1))))
 
(defun run/cc ()
  (with-call/cc (compute/cc 1000)))
 
(print (run/cc))

1
2
3
4
5
6
7
8
9
(defun/cc compute/cc (x)
  (cond ((zerop x) 0)
        (t (+ (compute/cc (1- x))
              1))))
 
(defun run/cc ()
  (with-call/cc (compute/cc 10000000)))
 
(print (run/cc))

1
2
3
4
5
6
7
(defun/cc compute/cc (x)
  (cond ((zerop x) 0)
        (t (+ (compute/cc (1- x))
              1))))
 
(defun run/cc ()
  (with-call/cc (compute/cc 10000000)))

1
2
3
4
5
6
7
8
9
(defun/cc smart-compute/cc (x)
  (cond ((zerop x) 0)
        ((zerop (mod x 100))  
         ;; on every 100th iteration use the trampoline
         (+ (trampoline/cc (smart-compute/cc (1- x)))
            1))
        (t 
         (+ (smart-compute/cc (1- x))
            1))))
 ...

1
2
3
4
5
6
7
8
9
(defun issimple (a b)
        (cond
                ((> b (/ a 2)) T)
                ((eq (mod a b) 0) Nil)
                (T (issimple a (+ b 1)))
        )
)
 
(defun/cc subf (a b lst)
 ...

1
2
3
4
5
6
7
8
9
(defun issimple (a b)
        (cond
                ((> b (/ a 2)) T)
                ((eq (mod a b) 0) Nil)
                (T (issimple a (+ b 1)))
        )
)
 
(defun/cc subf (a b lst)
 ...

1
2
3
4
5
6
7
8
9
(defun issimple (a b)
        (cond
                ((> b (/ a 2)) T)
                ((eq (mod a b) 0) Nil)
                (T (issimple a (+ b 1)))
        )
)
 
(defun subf (a b lst)
 ...

1
2
3
4
5
6
7
8
9
(defun issimple (a b)
        (cond
                ((> b (/ a 2)) T)
                ((eq (mod a b) 0) Nil)
                (T (issimple a (+ b 1)))
        )
)
 
(defun subf (a b lst)
 ...

1
2
3
4
5
6
7
8
9
(defun issimple (a b)
        (cond
                ((> b (/ a 2)) T)
                ((eq (mod a b) 0) Nil)
                (T (issimple a (+ b 1)))
        )
)
 
(defun subf (a b lst)
 ...

1
2
3
4
5
6
7
8
9
(defun issimple (a b)
        (cond
                ((> b (/ a 2)) T)
                ((eq (mod a b) 0) Nil)
                (T (issimple a (+ b 1)))
        )
)
 
(defun subf (a b)
 ...

1
2
3
4
5
6
7
8
9
(defun issimple (a b)
        (cond
                ((> b (/ a 2)) T)
                ((eq (mod a b) 0) Nil)
                (T (issimple a (+ b 1)))
        )
)
 
(defun subf (a b)
 ...

1
2
3
4
5
6
7
8
9
(defun issimple (a b)
        (cond
                ((> b (/ a 2)) T)
                ((eq (mod a b) 0) Nil)
                (T (issimple a (+ b 1)))
        )
)
 
(defun subf (a b)
 ...

1
2
3
4
5
6
7
8
9
(defun n-words-with-width-less-than (words fontsize length &optional (accum nil))
  "The first N words with a combined fontwidth (including spaces) less than the width required."
  (if (<= (* fontsize
             (+ (length accum) ;;Add the spaces.
                -1 ;;Minus one, since the last word needs no space after it.
                (apply #'+ (mapcar #'length accum))));;Total width of the words
          length)
      (if (null words) accum
          (n-words-with-width-less-than (cdr words) fontsize length (cons (car words) accum)))
 ...

1
2
3
4
5
6
7
8
9
    ;;Solution to facebook hacker cup Billboard brain teaser.
    ;;author: sea <http://sea4ever.users.sourceforge.net>
    ;; This program is free software: you can redistribute it and/or modify
    ;; it under the terms of the GNU General Public License as published by
    ;; the Free Software Foundation, either version 3 of the License, or
    ;; (at your option) any later version.
     
    ;; This program is distributed in the hope that it will be useful,
    ;; but WITHOUT ANY WARRANTY; without even the implied warranty of
 ...

1
2
3
4
5
6
7
8
9
;;Solution to facebook hacker cup Billboard brain teaser.
;;author: sea <http://sea4ever.users.sourceforge.net>
;; This program is free software: you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation, either version 3 of the License, or
;; (at your option) any later version.
 
;; This program is distributed in the hope that it will be useful,
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
 ...

1
2
3
4
5
6
7
8
9
;;Solution to facebook hacker cup Billboard brain teaser.
;;author: sea <http://sea4ever.users.sourceforge.net>
;; This program is free software: you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation, either version 3 of the License, or
;; (at your option) any later version.
 
;; This program is distributed in the hope that it will be useful,
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
 ...

1
(print "fuck you!")

1
(print "yes")

1
(print "yes")

1
(print "yes")

1
(ATOM ( ABC ) )

1
(ATOM ( T ) )

1
(ATOM ( 'T ) )

1
(print "Hello World")

1
(print Hello World)

1
(print "Hello World")

1
2
3
4
5
6
7
8
9
f~^kn~+c+ia~^+~cf+?/                        
                   [f!c-ki~:~b/au>++*+k~~r~bn!*+i                   
                <kk]k/>rkbrn~!:?[->+uc*a+af~>^b+ub+k                
              +i?:fn>+b+kb^+>kn?+ii/kb++u>?a+^+?+u>u?c+             
            i:+~/+>++:kba+~b?+:>+rr!b+k+++u?n<k!b**<i<c~i           
          <!^<<<<krb~^/]>>-u~/*-:<ck^<++!!:n+!kcbinc[~kr-:          
         *k:!kb?>c~>>*u!nnrbabi>+irn>i?+~+?>icc*+ci+i+!<<rb         
        ^knnb<!<!i<b^r<i!^/]>f/>>a/?>i~>~>>>b--.r/rucffa!/<n        
        <:u<?ua<cr<*:<i:bb<fu/nb.>b:r:*?**>n:!>::~/*+.>>r-:.:       
 ...