Recent public codes are listed below. You can filter them by the following programming languages:
- view
- All
- Ada
- Assembler
- Assembler
- AWK (gawk)
- AWK (mawk)
- Bash
- bc
- Brainf**k
- C
- C#
- C++
- C++0x
- C99 strict
- CLIPS
- Clojure
- COBOL
- COBOL 85
- Common Lisp (clisp)
- D (dmd)
- Erlang
- F#
- Factor
- Falcon
- Forth
- Fortran
- Go
- Groovy
- Haskell
- Icon
- Intercal
- Java
- JavaScript (rhino)
- JavaScript (spidermonkey)
- Lua
- Nemerle
- Nice
- Nimrod
- Objective-C
- Ocaml
- Oz
- Pascal (fpc)
- Pascal (gpc)
- Perl
- Perl 6
- PHP
- Pike
- Prolog (gnu)
- Prolog (swi)
- Python
- Python 3
- R
- Ruby
- Scala
- Scheme (guile)
- Smalltalk
- SQL
- Tcl
- Text
- Unlambda
- VB.NET
- Whitespace
-
1 2 3 4
(loop for line = (read-line *standard-input* nil nil) while (not (equal line "42")) do (format t "~A~%" line))
-
1 2 3 4
(loop for line = (read-line *standard-input* nil nil) while (not (equal line "42")) do (format t "~A~%" line))
-
1 2 3 4 5 6 7 8
(defparameter *battery-file* "/proc/acpi/battery/BAT0/state") (defun split-string (string delim) (let ((pos (position delim string))) (if (null pos) (cons string nil) (cons (subseq string 0 pos) (split-string (subseq string pos))))))
...
-
1 2 3 4 5 6 7 8 9
;;;; Example: "The Zebra Puzzle" ;;;; ;;;; Classic riddle popularly attributed to Lewis Carrol. (Essentially the ;;;; same as "The Einstein's Riddle".) ;;;; ;;;; This solution, contributed by Stephan Frank, uses the constraint ;;;; propagation features of Screamer. ;;;; ;;;; Five men with different nationalities live in the first five houses of a
...
-
1 2 3 4 5 6 7 8 9
a=[[[3,1],[5,1],[821,1],[273997,1],[7741805910970258163,1]],[[2,2],[107,1],[244219007447,1],[95966808334871,1]],[[2,2],[7,3],[919,1],[56951,1],[103160249,1],[4656410419,1]],[[2,3],[17,1],[177693403,1],[414883089729841223,1]],[[3,1],[31,1],[4951,1],[1346989159,1],[50461897989311,1]],[[7,2],[79,1],[241,1],[4271,1],[48523,1],[1051181,1],[176838479,1]],[[2,1],[1475709031,1],[12177009148932085937,1]],[[6323573,1],[4753519027288416018457,1]],[[2,1],[18164960872674393974925145111,1]]] a.length.times do |i| n=1 (a[i].length).times do |j| n*=a[i][j][0]**a[i][j][1] end s=""; (Math.log(n)/Math.log(256)).ceil.times do s=(n%256).chr+s
...
-
1 2 3 4
(defun foo () 1) (print (foo))
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (setq l (append l (list x)))) (setq x (+ x 1)) ) ) (format t "~{~A ~}:" (fu 1 10 1))
...
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (setq l (append l (list x)))) (setq x (+ x 1)) ) ) (format t "~{~A ~}" (fu 1 10 1))
...
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (setq l (append l (list x)))) (setq x (+ x 1)) ) ) (format t "~{~A ~}" (fu 1 10 1))
...
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (setq l (append l (list x)))) (setq x (+ x 1)) (format t "~A" x) ) )
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (setq l (append l (list x)))) (setq x (+ x 1)) (format t "~A" x) (format t l) )
...
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) then (append l (list x))) (setq x (+ x 1)) (format t "~A" x) (format t l) )
...
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (append l (list x))) (setq x (+ x 1)) (format t "~A" x) (format t l) )
...
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (append l (list x))) (setq x (+ x 1)) (format t "~A" x) ) )
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (append l '(x))) (setq x (+ x 1)) (format t "~A" x) ) )
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (append l '(x))) (setq x (+ x 1)) ) ) (format t "~{~A~}" (fu 1 10 1))
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (append l '(x))) (setq x (+ x 1)) ) ) (format t "~{~A}" (fu 1 10 1))
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (append l '(x))) (setq x (+ x 1)) ) ) (format t "" (fu 1 10 1))
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (append l '(x))) (setq x (+ x 1)) ) ) (format t "~A" (fu 1 10 1))
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (append l '(x))) (setq x (+ x 1)) ) ) (format t "~A" (fu 1 1 1))
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (append l '(x))) (setq x (+ x 1)) ) ) (format nil "~A" (fu 1 1 1))
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (append l '(x))) (setq x (+ x 1)) ) ) (format nil "A~" (fu 1 1 1))
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (append l '(x))) (setq x (+ x 1)) ) ) (format "A~" t (fu 1 1 1))
-
1 2 3 4 5 6 7 8 9
(defun fu (x y z) (setq l nil) (loop (if (> x y) (return l)) (if (= (rem x z) 0) (append l (x))) (setq x (+ x 1)) ) ) (format "A~" t (fu 1 1 1))
-
1 2 3 4 5 6 7
(define (f n) (do ((d (do ((i (- n 1) (- i 1)) (d '() (cons i d))) ((< i 0) d)) (append (cddr d) (list (car d))))) ((null? (cdr d)) (car d)))) (display (f 123456789))
-
1 2 3 4 5 6 7
(define (f n) (do ((d (do ((i (- n 1) (- i 1)) (d '() (cons i d))) ((< i 0) d)) (append (cddr d) (list (car d))))) ((null? (cdr d)) (car d)))) (display (f 123456789))
-
1 2 3 4
(defun add (x y) (+ x y)) (format t "~a" (add 2 3))
-
1 2
(defun hello() (format t "hello,world!"))
-
1 2
(defun hello() (format t "hello,world!"))
-
1
(+ 1 2 3 4)


