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
(define nbdigits (lambda (a) (if (= 0 a) 0 (+ 1 (nbdigits (quotient a 10)))))) (write (nbdigits 1)
-
1
(write (quotient 1 10))
-
1
(write (quotient (quotient 1 10) 10)))
-
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 (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 (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 (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 (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 (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 (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 (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 (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 (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5))))) (if (= 1 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1 2
(write (quotient 1034 10)) (write (/ 1034 10))
-
1 2 3 4 5
(define nbdigits (lambda (a) (if (= 0 a) 0 (+ 1 (nbdigits (/ a 10)))))) (write (nbdigits 1290))
-
1 2 3 4 5
(define nbdigits (lambda (a) (if (= 0 a) 0 (+ 1 (nbdigits (quotient a 10)))))) (write (nbdigits 1290))
-
1 2 3 4 5
(define nbdigits (lambda (a) (if (= 0 (modulo a 10)) 0 (+ 1 (nbdigits (floor (/ a 10))))))) (write (nbdigits 120))
-
1 2 3 4 5
(define nbdigits (lambda (a) (if (= 0 (modulo a 10)) 0 (+ 1 (nbdigits (/ a 10)))))) (write (nbdigits 120))
-
1 2 3 4 5
(define nbdigits (lambda (a) (if (= 0 (modulo a 10)) 0 (+ 1 (nbdigits (quotient a 10)))))) (write (nbdigits 10))
-
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 (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 (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 (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 (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5))))) (if (!= 0 (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 (floor (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5))))) (if (= 0 (modulo n 2)) (+ 1 fibn) fibn))))
...
-
1
(write (floor (/ 23 2)))
-
1
(write (/ 23 2))
-
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 (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))) (if (= 0 (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 (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5))))) (if (= 0 (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) (if (= 0 (modulo n 2)) (+ 1 (fibn (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))) (fibn (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))))) (write (fib 10))
-
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) (if (= 0 (modulo n 2)) (+ 1 (fibn (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5)))) (fibn (/ (exp (/ (+ 1 (sqrt 5)) 2) n) (sqrt 5))))))
...
-
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) (if (= 0 (modulo n 2)) 1 2))) (write (fib 10))


