1
2
(defun repost (r) (repost r))
(repost nil)

1
2
(defun repost (r) r)
(repost nil)

1
2
(defun repost (r) (r))
(repost nil)

1
2
(defun repost (r) (r))
(repost(nil))

1
2
3
(dolist (x '(1 2 3))
        (print x "a")
        (print x "b"))

1
(/ 615.44 3.14)

1
2
3
4
5
6
7
8
(define (fun a b c)
 ((if (> a b)
     (if (> b c) (+ (* a a) (* b b)) (+ (* a a) (* c c)))
     (if (> a c) (+ (* a a) (* b b)) (+ (* b b) (* c c)))
  )
 )
)
(fun 2 4 1)

1
(EVAL '(ADD 1 2))

1
cdr(12(12))

1
CDR(12(12))

1
2
3
4
5
6
7
8
9
(defun primes-to (n)
  ;;It's backwards
  (let ((candidates (loop for i from 2 to n collect i)) (primes nil) (test nil))
    (loop while candidates do
      (setf test (pop candidates))
      (unless (zerop test)
        (push test primes)
        (setf candidates (remove-if #'(lambda (x) (zerop (rem x test))) candidates))
        (when (> test (sqrt n))
 ...

1
(print "a")

1
((LAMBDA (X) (APPLY #'(LAMBDA (Y) (+ X Y)) 4)) 2)

1
2
(DEFUN F (A &KEY (B :C) (C :D))
   (LIST A B C))

1
2
3
(LET ((SUMA 0)
   (DOTIMES (I 3)
      (SETQ SUMA (+ SUMA I)))))

1
print "Kode Multus"

1
(format t "hi")

1
print "Kode Multus"

1
2
3
4
5
6
7
8
9
(defun fac (n)
    (if (= n 0)
        1
        (*
            n
            (fac (1- n))
        )
    )
)
 ...

1
2
3
(defun fac (n) (if (= n 0) 1 (* n (fac (1- n)))))
 
(print (fac 5))

1
2
3
(defun fac (n) (if (= n 0) 1 (fac (1- n))))
 
(print (fac 5))

1
2
3
4
5
6
7
8
9
(defvar *input* (make-list 1000))
 
(read-sequence *input* *standard-input*)
 
(setf *input* (mapcar
                #'(lambda (c)
                    (ecase c
                      (#\1 1) (#\2 2) (#\3 3) (#\4 4) (#\5 5) (#\6 6) (#\7 7)
                      (#\8 8) (#\9 9) (#\0 0))) *input*))
 ...

1
2
3
4
5
6
7
8
9
(defparameter *yo* (loop for x from 1 to 100
                      collect (loop for y from 1 to 100
                                 collect (- (random 1000) 500))))
 
(defun mazafake (*yo*)
  (let ((m nil)
        (yot (apply #'mapcar #'list *yo*)))
    (loop for x from 0 to (1- (length *yo*))
       do (loop for y from 0 to (1- (length yot))
 ...

1
2
3
4
5
6
7
8
9
 #include <stdlib.h>
 #include <string.h>
 
 typedef char BIT; /* needs only to hold the values 0 and 1 */
 
 const char *bitap_search(const char *text, const char *pattern)
 {
     const char *result = NULL;
     int m = strlen(pattern);
 ...

1
2
3
4
5
6
7
8
9
 #include <stdlib.h>
 #include <string.h>
 
 typedef char BIT; /* needs only to hold the values 0 and 1 */
 
 const char *bitap_search(const char *text, const char *pattern)
 {
     const char *result = NULL;
     int m = strlen(pattern);
 ...

1
2
3
4
5
6
7
8
(
defun cont (lista)
(
if (equal lista nil)
  0
(
    + 1 (cont (cdr lista)) 
)
 ...

1
2
3
4
5
6
7
8
(
defun cont (lista)
(
if (equal lista nil)
  0
(
    + 1 (cont (cdr lista)) 
)
 ...

1
2
3
4
5
6
7
8
(
defun cont (lista)
(
if (equal lista nil)
  0
(
    + 1 (cont (cdr lista)) 
)
 ...

1
2
3
4
5
6
7
8
(
defun cont (lista)
(
if (equal lista nil)
  0
(
    + 1 (cont (cdr lista)) 
)
 ...

1
2
3
4
5
6
7
8
(
defun cont (lista)
(
if (equal lista nil)
  0
(
    + 1 (cont (cdr lista)) 
)
 ...