You should show how the program or function is executed, accepting the input, and printing the output. Writing a challenge So, you want to write your own challenge? If you're new, consider …

34 Languages, 19 bytes, Score: 38,832,018,459,912,437,760,000 Here is a quick answer I threw together to show that it is possible to get an answer scoring better than 1. ...

The Programming Language Quiz, Mark II - Cops Curry PAKCS, 57 bytes, cracked by Potato44 f []="" f ( [x]++s)=show x++" "++f s main=putStr (f [1..100]) Looks like Haskell but it doesn't run …

The Programming Language Quiz, Mark II - Cops Curry PAKCS, 57 bytes, cracked by Potato44 f []="" f ( [x]++s)=show x++" "++f s main=putStr (f [1..100]) Looks like Haskell but it doesn't run …

How does math work in Anastasiya's world? Haskell, 108 bytes f=map (read.pure).show g h= (\x-> (h.f$last x,length x+1)).takeWhile (>10).iterate (h.f) (a#b)o=g (foldr1 o)$o a b Defines the …

Be big more often Related You are a manager at a large number factory. You want to show everyone your business is doing well, by showing randomly chosen samples. Unfortunately, …

Levenshtein distance & OEIS (Cops) Haskell, LD = 13, cracked ( (snd.span (<'1').reverse.show. (^2)=<< [1..])!!) Try it online! I double-checked that leading zeros are trimmed ;) ... Laikoni …

Show a balanced binary tree Given an integer \$n > 1\$, output a balanced binary tree with \$n\$ leaf nodes. The tree should be constructed out of (space), ... 97.100.97.109 asked Oct 22, …

Quining a Pristine World Haskell, 132 bytes q x=if length x==132then putStr x else fail [];main=q$ (++)<*>show$"q x=if length x==132then putStr x else fail [];main=q$ (++)<*>show$" ...

May 8, 2024 · Show a balanced binary tree Given an integer \$n > 1\$, output a balanced binary tree with \$n\$ leaf nodes. The tree should be constructed out of (space), ... code-golf ascii-art …