Search Results

Haskell, 8 bytes gcd 3 21 Outputs 3, and gcd 3 211 outputs 1.

MSM, 8 bytes '.qp.;.; Transforms the source code to pqpqpqpq MSM operates on a list of strings. Commands are taken from the left and they treat the right side as a stack. MSM always works on it's …

Haskell, 14 11 bytes (*)=<<pred$ Usage example Prelude> (*)=<<pred$5 20 Prelude> (*)=<<pred$(*)=<<pred$5 380 Prelude> (*)=<<pred$(*)=<<pred$(*)=<<pred$5 144020 Maybe this isn't a proper function …

Haskell, 124 bytes Forward: f=id --esrever.q pam=2>1|esrever=2<1|f;x=x q;')'='(' q;'('=')' q;']'='[' q;'['=']' q;'>'='<' q;'<'='>' q;'}'='{' q;'{'='}' q Normal reverse: q '}'='{';q '{'='}';q '>'= …

Haskell, 88 65 bytes main=putStr ...........-- .."figure".......... --"ground"........ and ........... main=putStr.. --........"figure"-- .........."ground" . indicates a space. Just some line c …

Haskell, 7x7 6x6 f=b>>y y=b++n n="\n" b=c++d c=d++d d="--" Outputs ------ ------ ------ ------ ------ ------ Try it online! How it works: f= -- main function which returns the stri …

Haskell Cracks @Laikoni's answer. s=map;hay=zipWith;a=head;h=s a.(hay(scanr id).s a<*>s(succ<$))$words"Haysta ayst ackH ays k ayst" Try it online! Original code: hays=map;hay=zipWith;stack=head; …

Haskell, 185 161 bytes t i = i af n m u a e i l p s d lu h=u ( h e a d a ) t h e n [ ] e l s e m a p h e a d a : t ( m a p t a i l a ) Try it onlin …

Haskell, 11 bytes f=log pxe=f and in reverse order: f=exp gol=f This works without the "comment" trick. Instead each version defines an additional, but unused function (pxe/ gol).

Haskell, 235 bytes main=interact$unlines.g.lines;g l@("":_)=l; g l|t<-tail<$>l,n<-length t=zipWith(:)(head<$>l)$ g$take n$drop(n-1)$t++t maim=interact$unlines.h.lines;h l@("":_)=l; h l|t<-tail<$>l,n< …

MSM, 73 bytes GGreetings, Planet!.................,.................!tenalP ,sgniteerGG The first half just before the middle , builds a reverse greeting string including the additional G on the ve …

Haskell, 8 bytes (-8+).id Try it online! Like many other answers it returns 0 for truthy and non-0 for falsy by repeatedly subtracting the length of the code from the input number.

Haskell, 12 bytes f=id;x-0=x f Try it online! Reverse: f x=0-x;di=f Try it online! Not as short as Ørjan Johansen's answer, but without comments.

Haskell, 48 bytes a _="Programming Puzzles";a4="Code\32Golf";f=a 4 a_="ProgrammingPuzzles";a4="Code\32Golf";f=a4 Defines function f which returns the corresponding string. For reference, the old v …

Haskell, 42 bytes (8-8)-(-(8-8)^(8-8))--((8-8)^(8-8)-)-(8-8) Luckily a line comment in Haskell (-> --) is mirrorable and half of it (-> -) is a valid function. The rest is some math to get the numb …