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 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define (factorial n) (define (f n k) (if (= n 0) (k 1) (f (- n 1) (lambda (acc) (* acc n))))) (f n (lambda (acc) acc))) (display (factorial 3))
-
1 2 3 4 5 6 7 8
(define (factorial n) (define (f n k) (if (= n 0) (k 1) (f (- n 1) (lambda (acc) (* acc n))))) (f n (lambda (acc) acc))) (display (factorial 2))
-
1 2 3 4 5 6 7 8
(define (factorial n) (define (f n k) (if (= n 0) (k 1) (f (- n 1) (lambda (acc) (* acc n))))) (f n (lambda (acc) acc))) (display (factorial 1))
-
1 2 3 4 5 6 7 8
(define (factorial n) (define (f n k) (if (= n 0) (k 1) (f (- n 1) (lambda (acc) (* acc n))))) (f n (lambda (acc) acc))) (display "~a" (factorial 1))
-
1 2 3 4 5 6 7 8 9
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define (factorial n) (define (f n k) (if (= n 0) (k 1) (f (- n 1) (lambda (acc) (* acc n))))) (f n (lambda (acc) acc))) (print (factorial 1))
-
1 2 3 4 5 6 7 8 9
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define (factorial n) (define (f n k) (if (= n 0) (k 1) (f (- n 1) (lambda (acc) (* acc n))))) (f n (lambda (acc) acc))) (factorial 1)
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1
(write (log e))
-
1
(write (log 1000))
-
1 2 3 4 5 6 7 8 9
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8 9
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8 9
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2 3 4 5 6 7 8
(define exp (lambda (a b) (if (= b 1) a (* a (exp a (- b 1)))))) (define fib (lambda (n) (let ((fibn (inexact->exact (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...


