Free Ideone API
try it now!
Your great ideas will be born here
Recent public pastes are listed below. You can filter them by the following programming languages:
- view
- All
- Ada
- Assembler
- AWK (gawk)
- AWK (mawk)
- Bash
- bc
- Brainf**k
- C
- C#
- C++
- 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
- Ocaml
- Oz
- Pascal (fpc)
- Pascal (gpc)
- Perl
- Perl 6
- PHP
- Pike
- Prolog (gnu)
- Prolog (swi)
- Python
- Python 3
- R
- Ruby
- Scala
- Scheme (guile)
- Smalltalk
- Tcl
- Text
- Unlambda
- Visual Basic .NET
- Whitespace
-
1
(display (apply (lamda(x y)(if (> x y) x y)) '(1 2 3 3 3 5 8 3)))
-
1
(display (apply (lamda(x y)(if (> x y) x y) '(1 2 3 3 3 5 8 3)))
-
1
(display (apply max '(1 2 3 3 3 5 8 3)))
-
1 2 3 4 5 6 7 8
(define (do_it n) (define (print_it n) (display n) (newline)) (cond ((not(= n 42)) (print_it n) (do_it (read))) ))
-
1 2 3
(define (f l1 l2) (map (lambda (x) (cons x l1)) (map car l2))) (f `(a b c d) ((1 2) (3 4) (5 6)))
-
1 2 3
(define (f l1 l2) (map (lambda (x) (cons x l1)) (map car l2))) (f cons(a b c d) ((1 2) (3 4) (5 6)))
-
1 2 3
(define (f l1 l2) (map (lambda (x) (cons x l1)) (map car l2))) (f (a b c d) ((1 2) (3 4) (5 6)))
-
1 2 3
(define (f l1 l2) (map (lambda (x) (cons x l1)) (map car l2))) (f '(a b c d) ((1 2) (3 4) (5 6)))
-
1 2 3 4 5
(define (f l1 l2) (map (lambda (x) (cons x l1)) (map car l2))) (f '(a b c d) ((1 2) (3 4) (5 6)))
-
1 2 3
(define (f x y) (if (= x 1) (- x) y)) (define (g) ((lambda () 1))) (define (h) (h)) (f (g) (h))
-
1 2
(define (fat n) (if (= n 0) 1 (* n (fat (- n 1))))) (write(fat (read)))
-
1 2
(define (fat n) (if (= n 0) 1 (* n (fat (- n 1))))) (write(fat (read)))
-
1 2
(define (fat n) (if (= n 0) 1 (* n (fat (- n 1))))) (write(fat (read)))
-
1 2
(define (fat n) (if (= n 0) 1 (* n (fat (- n 1))))) (write(fat (read)))
-
1 2 3 4 5 6 7 8 9
(define fact/cps (lambda (n cont) (cond ((= n 0) (cont 1)) (else (fact/cps (- n 1) (lambda (m) (cont (* n m)))))))) (define main (lambda () (print (map fact/cps '(1 2 3 4 5 6)))))
-
1 2
(define (fat n) (if (= n 0) 1 (* n (fat (- n 1))))) (write(fat (read)))
-
1 2
(define (fat n) (if (= n 0) 1 (* n (fat (- n 1))))) (write(fat (read)))
-
1 2 3 4 5
(define (fib n) (define (fibaux v l c) (if (= c n) v (fibaux (+ v l) v (+ c 1)))) (fibaux 0 1 0)) (write (fib (read)))
-
1 2 3 4 5
(define (fib n) (define (fibaux v l c) (if (= c n) v (fibaux (+ v l) v (+ c 1)))) (fibaux 0 1 0)) (write (fib (read)))
-
1 2 3 4 5
(define (fib n) (define (fibaux v l c) (if (= c n) v (fibaux (+ v l) v (+ c 1)))) (fibaux 0 1 0)) (write (fib (read)))
-
1 2 3 4 5
(define (fib n) (define (fibaux v l c) (if (= c n) v (fibaux (+ v l) v (+ c 1)))) (fibaux 0 1 0)) (write (fib (read)))
-
1 2 3 4 5
(define (fib n) (define (fibaux v l c) (if (= c n) v (fibaux (+ v l) v (+ c 1)))) (fibaux 0 1 0)) (write (fib (read)))
-
1 2 3 4 5
(define (fib n) (define (fibaux v l c) (if (= c n) v (fibaux (+ v l) v (+ c 1)))) (fibaux 0 1 0)) (write (fib (read)))
-
1 2 3 4 5
(define (fib n) (define (fibaux v l c) (if (= c n) v (fibaux (+ v l) v (+ c 1)))) (fibaux 0 1 0)) (write (fib (read)))
-
1 2 3 4 5
(define (fib n) (define (fibaux v l c) (if (= c n) v (fibaux (+ v l) v (+ c 1)))) (fibaux 0 1 0)) (write (fib (read)))
-
1 2 3 4 5
(define (fib n) (define (fibaux v l c) (if (= c n) v (fibaux (+ v l) v (+ c 1)))) (fibaux 0 1 0)) (write (fib (read)))
-
1 2 3 4 5 6 7 8 9
#include <iostream> int main() { int n; std::cout << "input a number: "; std::cin >> n; std::cout << n << std::endl; return 0; }
-
1 2 3 4 5 6 7 8 9
#include <iostream> int main() { int n; std::cout << "input a number: "; std::cin >> n; std::cout << n << std::endl; return 0; }
-
1 2 3 4 5 6 7 8 9
(((lambda (f) ((lambda (g) (g g)) (lambda (g) (f (lambda (x) ((g g) x)))))) (lambda (f) (lambda (n) (cond ((<= n 1) 1) (else (* (f (- n 1)))))))) 5)
-
1
(+ 2 4)
