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
main = do 3 `div` 5
-
1 2
3 `div` 5
-
1 2 3 4
main = do x <- [1,2] y <- [4,5] return (x,y)
-
1 2 3 4 5 6 7 8 9
main = do x <- readNum if x == 42 then putStr("") else do putStr (show (x) ++ "\n") main where readNum :: IO Integer
...
-
1 2 3 4 5 6
import System.IO quicksort [] = [] quicksort (x:xs) = quicksort [y | y <- xs, y < x] ++ [x] ++ quicksort [y | y <- xs, y >= x] main = print . quicksort =<< getLine
-
1 2 3 4
lcd a b = a*b / (gcd a b) main = do print $ foldl lcd 1 [2..20]
-
1 2 3 4 5
gcd a b = gcd b $ a mod b gcd a 0 = a main = do print $ gcd 5 3
-
1 2
main = do print $ foldl (*) 1 [1..20]
-
1 2 3 4
import System.IO quicksort [] = [] quicksort (x:xs) = quicksort [y | y <- xs, y < x] ++ [x] ++ quicksort [y | y <- xs, y >= x] main = print . quicksort =<< getLine
-
1 2 3 4
import System.IO quicksort [] = [] quicksort (x:xs) = quicksort [y | y <- xs, y < x] ++ [x] ++ quicksort [y | y <- xs, y >= x] main = print . quicksort =<< getLine
-
1 2 3 4
import System.IO quicksort [] = [] quicksort (x:xs) = quicksort [y | y <- xs, y < x] ++ [x] ++ quicksort [y | y <- xs, y >= x] main = print . quicksort =<< getLine
-
1
5 + 6
-
1 2
lst = [1..5] print lst
-
1 2 3 4 5
main = do x <- readIO =<< getLine if x == 42 then putStr("") else ( putStr (show (x) ++ "\n") ) >> main
-
1 2 3 4 5
main = do x <- getLine >>= readIO if x == 42 then putStr("") else ( putStr (show (x) ++ "\n") ) >> main
-
1 2 3 4 5
main = do x <- readIO getLine if x == 42 then putStr("") else ( putStr (show (x) ++ "\n") ) >> main
-
1 2 3 4 5
main = do x <- read getLine if x == 42 then putStr("") else ( putStr (show (x) ++ "\n") ) >> main
-
1 2 3 4 5
main = do x <- readIO getLine if x == 42 then putStr("") else ( putStr (show (x) ++ "\n") ) >> main
-
1 2 3 4 5
main = do x <- getLine if digitToInt x == 42 then putStr("") else ( putStr (show (x) ++ "\n") ) >> main
-
1 2 3 4 5
main = do x <- getLine if x == 42 then putStr("") else ( putStr (show (x) ++ "\n") ) >> main
-
1 2 3 4 5
main = do x <- getLine if x == 42 then putStr("") else ( putStr (show (x) ++ "\n") ) >>= main
-
1 2 3 4 5
main = do x <- getLine if x == 42 then putStr("") else putStr (show (x) ++ "\n") >>= main
-
1 2 3 4 5 6 7
main = do x <- getLine if x == 42 then putStr("") else do putStr (show (x) ++ "\n") main
-
1 2 3 4 5 6 7 8
main = do x <- do line <- getLine if x == 42 then putStr("") else do putStr (show (x) ++ "\n") main
-
1
main = print "Hello!"
-
1 2 3 4 5 6 7 8
data Tree x = Leaf x | Branch (Tree x) (Tree x) linear (Leaf x) = [x] linear (Branch left right) = (linear left) ++ (linear right) child n t = take 1 (drop (n-1) (linear t)) a = (Branch (Branch (Branch (Leaf 1) (Branch (Leaf 2) (Leaf 3))) (Branch (Leaf 4) (Leaf 5))) (Leaf 6))
...
-
1 2 3 4 5 6 7 8 9
main = do putStr (show (child 3 a)) where data Tree x = Leaf x | Branch (Tree x) (Tree x) linear (Leaf x) = [x] linear (Branch left right) = (linear left) ++ (linear right) child n t = take 1 (drop (n-1) (linear t))
...
-
1
cycle [a .. z]
-
1 2 3 4 5 6 7 8 9
main = do x <- readNum if x == 42 then putStr("") else do putStr (show (x) ++ "\n") main where readNum :: IO Integer
...
-
1
main = getContents >>= (\x -> putStrLn $ unlines $ takeWhile (/="42") $ lines x)


