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
5+3
-
1 2 3 4 5 6 7
{-# LANGUAGE DeriveDataTypeable #-} import Data.Data import Data.Typeable data MyFun = MyFun (Int -> Int) deriving (Data, Typeable)
-
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
import Debug.Trace mycons xs x | trace (show xs) True = x:xs main = putStrLn.show $ foldl mycons [] [1..10]
-
1 2 3 4 5 6
right = foldr (:) [1] [2,3,4] --left = foldl (:) [1] [2,3,4] main = do print right -- print left
-
1 2 3 4 5 6
right = foldr (:) [1] [2,3,4] left = foldl (:) [1] [2,3,4] main = do print right print left
-
1 2 3 4 5
module Main where main = putStrLn (stringMod (-5) 2) stringMod x y = show (mod x y)
-
1 2 3
fibs = 0 : 1 : zipWith (+) fibs (tail fibs) main = print $ fibs !! 10
-
1 2 3 4 5 6 7 8 9
-- -- addition of very long integers -- import Data.Char import Data.String addRev [] [] 0 = [] addRev la [] c = addRev la [0] c
...
-
1
f=showHex 12
-
1
1+2
-
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 7 8 9
main = do print $ pr 100000 pr :: Int -> [Int] pr a | a <= 0 = error "fu" | a <= 2 = [2] | a <= 3 = [2,3] | a <= 5 = [2,3,5]
...
-
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 7 8 9
module Arith where import Control.Monad.Error import Control.Monad.Identity data Term = TmTrue | TmFalse | TmIf Term Term Term
...
-
1 2 3 4 5 6 7 8 9
import Control.Monad.Trans.Reader add :: (Num a) -> a -> Reader a a add num = do otherNum <- ask return (num + otherNum) main = do let answer = (`runReader` 5) $ do
...
-
1 2 3 4 5 6 7 8 9
import Control.Monad.Reader add :: (Num a) -> a -> Reader a a add num = do otherNum <- ask return (num + otherNum) main = do let answer = (`runReader` 5) $ do
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
main = do print $ pr 100 pr :: Int -> [Int] pr a | a <= 0 = error "fu" | a <= 2 = [2] | a <= 3 = [2,3]
...
-
1 2 3 4 5 6 7 8 9
main = do print $ pr 100 pr :: Int -> [Int] pr a | a <= 0 = error "fu" | a <= 2 = [2] | a <= 3 = [2,3]
...
-
1 2 3 4 5 6 7 8 9
main = do print $ pr 100 pr :: Int -> [Int] pr a | a <= 0 = error "fu" | a <= 2 = [2] | a <= 3 = [2,3]
...
-
1 2 3 4 5 6 7 8 9
main = do print $ pr 100 pr :: Int -> [Int] pr a | a <= 0 = error "fu" | a <= 2 = [2] | a <= 3 = [2,3]
...
-
1 2 3
main = do print [1..5]
-
1 2 3
main = do [1..5]
-
1 2 3 4 5 6 7 8 9
main = do pr 100 pr :: Int -> [Int] pr a | a <= 0 = error "fu" | a <= 2 = [2] | a <= 3 = [2,3]
...
-
1 2 3 4 5 6 7 8 9
main = do pr 100 pr a | a <= 0 = error "fu" | a <= 2 = [2] | a <= 3 = [2,3] | a <= 5 = [2,3,5]
...
-
1 2 3 4 5 6 7 8 9
main::IO() main = do $ pr 100 pr a | a <= 0 = error "fu" | a <= 2 = [2] | a <= 3 = [2,3] | a <= 5 = [2,3,5]
...
-
1 2 3 4 5 6 7 8
pr a | a <= 0 = error "fu" | a <= 2 = [2] | a <= 3 = [2,3] | a <= 5 = [2,3,5] | a <= 7 = [2,3,5,7] | a <= 9 = [2,3,5,7,9] | otherwise = [2,3,5,7,9] ++ [ x | x <- [9..a], x`mod`2 /= 0, x`mod`3 /= 0, x`mod`5 /= 0, x`mod`7 /= 0, x`mod`9 /= 0 ]
-
1 2 3 4 5 6 7 8 9
def sieve(n): is_prime = [True for i in xrange(n)] is_prime[0] = is_prime[1] = False primes = [] for prime, is_p in enumerate(is_prime): if is_p: for i in xrange(prime*2, n, prime): is_prime[i] = False primes.append(prime)
...
-
1 2 3 4 5 6 7 8 9
def sieve(n): is_prime = [True for i in xrange(n)] is_prime[0] = is_prime[1] = False primes = [] for prime, is_p in enumerate(is_prime): if is_p: for i in xrange(prime*2, n, prime): is_prime[i] = False primes.append(prime)
...


