Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Stack Internal
Knowledge at work
Bring the best of human thought and AI automation together at your work.
Explore Stack Internal-2 thanks to ovs.
и.«mGm Try it online!Try it online! Beats all other answers
и.«mGm # full program .«G # reduce... и for N in [1, #2, list3, of..., # implicit input... #, implicit input... и G # s... minus 1].«.. m # left bypush... # (implicit) first element in reduceinput... m # to the power of... # implicit input... # (implicit) secondor elementtop inof reduce,stack endif reduce not first iteration # implicit output и.«m и.«m # full program .« # reduce... и # list of... # implicit input... # implicit input... и # s... .« # left by... # (implicit) first element in reduce... m # to the power of... # (implicit) second element in reduce, end reduce # implicit output -2 thanks to ovs.
Gm Try it online! Beats all other answers
Gm # full program G # for N in [1, 2, 3, ..., # ..., implicit input... G # ...minus 1]... m # push... # implicit input... m # to the power of... # implicit input... # (implicit) or top of stack if not first iteration # implicit output sUXGD}XGmи.«m и.«m # (implicit) push STDIN tofull stackprogram s .« # swap top two stack valuesreduce... U и # store toplist of stack in X... X # push X toimplicit stackinput... G # for N in [1, 2,implicit input..., и top of stack - 1]# s... D .« # duplicate top ofleft stackby... } # exit loop X #(implicit) pushfirst Xelement toin stackreduce... G m # for N in [1, 2,to ...,the toppower of stack - 1]... m # push (second to top of stackimplicit) ^ (top of stack) second element in reduce, end reduce # (implicit) exit loop, output top of stack to STDOUT sUXGD}XGm # (implicit) push STDIN to stack s # swap top two stack values U # store top of stack in X X # push X to stack G # for N in [1, 2, ..., top of stack - 1]... D # duplicate top of stack } # exit loop X # push X to stack G # for N in [1, 2, ..., top of stack - 1]... m # push (second to top of stack) ^ (top of stack) # (implicit) exit loop, output top of stack to STDOUT и.«m и.«m # full program .« # reduce... и # list of... # implicit input... # implicit input... и # s... .« # left by... # (implicit) first element in reduce... m # to the power of... # (implicit) second element in reduce, end reduce # implicit output sUXGD}XGm # (implicit) push STDIN to stack s # swap top two stack values U # store top of stack in X X # push X to stack G # for N in [1, 2, ..., top of stack - 1]... D # duplicate top of stack } # exit loop X # push X to stack G # for N in [1, 2, ..., top of stack - 1]... m # push (second to top of stack) ^ (top of stack) # (implicit) exit loop, output top of stack to STDOUT sUXGD}XGm # (implicit) push STDIN to stack s # swap top two stack values U # store top of stack in X X # push X to stack G # for N in [1, 2, ..., top of stack - 1]... D # duplicate top of stack } # exit loop X # push X to stack G # for N in [1, 2, ..., top of stack - 1]... m # push (second to top of stack) ^ (top of stack) # (implicit) exit loop sUXGD}XGm # (implicit) push STDIN to stack s # swap top two stack values U # store top of stack in X X # push X to stack G # for N in [1, 2, ..., top of stack - 1]... D # duplicate top of stack } # exit loop X # push X to stack G # for N in [1, 2, ..., top of stack - 1]... m # push (second to top of stack) ^ (top of stack) # (implicit) exit loop, output top of stack to STDOUT 
