1
2
3
4
5
6
7
8
quicksort :: Ord a => [a] -> [a]
quicksort []     = []
quicksort (p:xs) = (quicksort $! lesser) ++ [p] ++ (quicksort $! greater)
    where
        lesser  = (filter $! (< p)) $! xs
        greater = (filter $! (>= p))$! xs
 
main = print $ length $ quicksort [1..10000]

1
main = putStrLn "Заебись. Чётко."

1
2
3
4
5
6
7
8
module Main where
 
import Control.Applicative 
import Control.Monad
import Data.Char
import Data.List
import Text.ParserCombinators.ReadP
import Text.Printf
 ...

1
2
3
4
5
6
7
import Data.Monoid
 
main :: IO ()
main = do
  print $ [] `mappend` []
  print $ 5 `mappend` 6
-- print $ 5 `mappend` [] --(This is a compiler error.)

1
2
3
4
5
6
7
8
9
begin 644 webutils_pl
M8F5G:6X@-C0T(&EN9F\R+FAT;6P-"DTO(UU8.S900#U&-5(\5D5/.T-40BPR
M6%`H0F!?+T)@0")#4$$Q)%TC-25%,#$R(4@])E5,*"4A-3!$42D-"DTP4F!"
M*S)<3S53+2,K4ETD-20P0#8D030S-%!`+#)84"@E,5(X-EE3.C<Q23M664$[
M(EQ/,3180B)"8$(-"DTZ)S%4/"-(3RM7/5<]4EE7+%)93SQ&/$\U)2A//B9!
M5#LV4%$K5#$T,2)=6#HG,4T[(R1-/2<I03M'+4D-"DT])D5/.T8E3"M&,50Y
M(BA>(D!(0"@B8"DH8$1`(D)@0"A@1$`H8$0I(C!(7#HG,4T[(B%8.S913CQ3
M5$(-"DTZ)S%4/"-(3RM7/5<]4EE7+%)93SQ&/$\L,T19+C)=6#HG,4T[(BA>
M+R9!13@V,%XH(F!`(C!$*2@B8"D-"DTB0U%4.C<Q3#DS62<Y-EU#.#8M2#DR
 ...

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
         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
         x <- readNum
         if x == 42
           then putStr("")
           else do
             putStr  (show (x) ++ "\n")
             main
       where
         readNum :: IO Integer
 ...

1
2
3
module Main where
 
main = putStrLn "тест"

1
2
3
module Main where
 
main = putStrLn "test"

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
module Foo where
 
instance Monad List where
        return = Pure
        (>>=) = map . concat
 
f = \x -> x + 1
g = f . f

1
2
3
4
5
6
7
8
module Main where
 
import Control.Applicative 
import Control.Monad
import Data.Char
import Data.List
import Text.ParserCombinators.ReadP
import Text.Printf
 ...

1
2
3
4
5
6
7
8
module Main where
 
import Control.Applicative 
import Control.Monad
import Data.Char
import Data.List
import Text.ParserCombinators.ReadP
import Text.Printf
 ...

1
2
3
4
5
6
7
8
module Main where
 
import Control.Applicative 
import Control.Monad
import Data.Char
import Data.List
import Text.ParserCombinators.ReadP
import Text.Printf
 ...

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
26*34

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
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
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
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
1 + 2
 

1
main = getLine >>= putStrLn

1
main = putStrLn "hello world"

1
2
3
4
5
6
7
8
9
-- Sanjay Paul
-- 01.18.2012
-- CIS194 - Introduction to Haskell
-- CreditCardVerification.hs
 
-- Description: 
{-
Implement the validation algorithm for credit cards.
It follows these steps:
 ...

1
2
3
4
5
6
7
8
9
-- Sanjay Paul
-- 01.18.2012
-- CIS194 - Introduction to Haskell
-- CreditCardVerification.hs
 
-- Description: 
{-
Implement the validation algorithm for credit cards.
It follows these steps:
 ...

1
2
3
4
5
6
7
8
9
main = do
         x <- readNum
         if x == 45
           then putStr("")
           else do
             putStr  (show (x) ++ "\n")
             main
       where
         readNum :: IO Integer
 ...

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
         x <- readNum
         if x == 42
           then putStr("")
           else do
             putStr  (show (x) ++ "\n")
             main
       where
         readNum :: IO Integer
 ...

1
5 + ""