Skip to main content
deleted 17 characters in body
Source Link
Kevin Cruijssen
  • 131.4k
  • 13
  • 144
  • 384

yup, 99 7 bytes

0e{*:{:@@@@*}

Try it online.Try it online.

Explanation:

0e*        # Push a 1 (push 0; pop andthe pushfirst exp(0))input-character
  {     }  # Loop as long as the top of the stack is NOT 0 (without popping):
          # (the initial `0e``*` is to start the loop, after that it's irrelevant)
   *:      #  PushDuplicate the next input-character
  so there are two on the stack
   @@ #  (which will# push 0Pop ifboth, thereand areprint nothem moreas input(-character)s)characters
    :: *   #  Duplicate it twice soPush therethe arenext threeinput-character onfor the stacknext iteration
      @@   #  Pop(which bothwill duplicates,push and0 printif themthere asare charactersno more input(-character)s left)

yup, 9 bytes

0e{*::@@}

Try it online.

Explanation:

0e        # Push a 1 (push 0; pop and push exp(0))
  {     } # Loop as long as the top of the stack is NOT 0:
          # (the initial `0e` is to start the loop, after that it's irrelevant)
   *      #  Push the next input-character
           #  (which will push 0 if there are no more input(-character)s)
    ::    #  Duplicate it twice so there are three on the stack
      @@  #  Pop both duplicates, and print them as characters

yup, 9 7 bytes

*{:@@*}

Try it online.

Explanation:

*        # Push the first input-character
 {    }  # Loop as long as the top of the stack is NOT 0 (without popping):
         # (the initial `*` is to start the loop)
  :      #  Duplicate the character so there are two on the stack
   @@    #  Pop both, and print them as characters
     *   #  Push the next input-character for the next iteration
         #  (which will push 0 if there are no more input(-character)s left)
fixed typo
Source Link
Kevin Cruijssen
  • 131.4k
  • 13
  • 144
  • 384

yup, 9 bytes

0e{*::@@}

Try it online.

Explanation:

0e        # Push a 1 (push 0; pop and push exp(0))
  {     } # Loop as long as the top of the stack is NOT 0:
          # (the initial `0e` is to start the loop, after that it's irrelevant)
   *      #  Push the next input-character
          #  (which will push 0 if there isare no more inputsinput(-character)s)
    ::    #  Duplicate it twice so there are three on the stack
      @@  #  Pop both duplicates, and print them as characters

yup, 9 bytes

0e{*::@@}

Try it online.

Explanation:

0e        # Push a 1 (push 0; pop and push exp(0))
  {     } # Loop as long as the top of the stack is NOT 0:
          # (the initial `0e` is to start the loop, after that it's irrelevant)
   *      #  Push the next input-character
          #  (which will push 0 if there is no more inputs)
    ::    #  Duplicate it twice so there are three on the stack
      @@  #  Pop both duplicates, and print them as characters

yup, 9 bytes

0e{*::@@}

Try it online.

Explanation:

0e        # Push a 1 (push 0; pop and push exp(0))
  {     } # Loop as long as the top of the stack is NOT 0:
          # (the initial `0e` is to start the loop, after that it's irrelevant)
   *      #  Push the next input-character
          #  (which will push 0 if there are no more input(-character)s)
    ::    #  Duplicate it twice so there are three on the stack
      @@  #  Pop both duplicates, and print them as characters
Source Link
Kevin Cruijssen
  • 131.4k
  • 13
  • 144
  • 384

yup, 9 bytes

0e{*::@@}

Try it online.

Explanation:

0e        # Push a 1 (push 0; pop and push exp(0))
  {     } # Loop as long as the top of the stack is NOT 0:
          # (the initial `0e` is to start the loop, after that it's irrelevant)
   *      #  Push the next input-character
          #  (which will push 0 if there is no more inputs)
    ::    #  Duplicate it twice so there are three on the stack
      @@  #  Pop both duplicates, and print them as characters