Skip to main content
Code Golf

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

11
  • 1
    \$\begingroup\$ Seems clear enough to me - we are not required to use it, but can do so if we want. \$\endgroup\$
    – Jonathan Allan
    Commented Jan 18, 2018 at 21:01
  • 1
    \$\begingroup\$ @tuskiomi The footer is just formatting the list output for clarity... as a full program (rather than as a function) the code will print Jelly's format of a list (nothing for empty & no enclosing [] for lists of length 1). \$\endgroup\$
    – Jonathan Allan
    Commented Jan 18, 2018 at 21:42
  • 1
    \$\begingroup\$ @tuskiomi TIO has limits ;-) but I think it works theoretically. \$\endgroup\$
    – Erik the Outgolfer
    Commented Jan 18, 2018 at 21:46
  • 1
    \$\begingroup\$ @tuskiomi the Cartesian power would result in a list of 23!^4 lists. It will run out of time (60s limit on TIO) if not memory. \$\endgroup\$
    – Jonathan Allan
    Commented Jan 18, 2018 at 21:46
  • 1
    \$\begingroup\$ N!^M where N is the product and M is the number of terms (and in space too!!) \$\endgroup\$
    – Jonathan Allan
    Commented Jan 18, 2018 at 21:54