Skip to main content
Code Golf

Return to Answer

deleted 158 characters in body
Source Link
Addison Crump
Addison Crump
  • 11.2k
  • 1
  • 44
  • 90

Vitsy, 11 9 88 6 Bytes

This programming language was obviously made past the date of release for this question, but I thought I'd post an answer so I can a) get more used to it and b) figure out what else needed to be implemented.

'rd3*l\O'rd3*Z

The explanation is as follows:

'rd3*l\O
'           Start recording as a string.

(wraps around once, capturing all the items)

'           Stop recording as a string. We now have everything recorded but the original ".
 r          Reverse the stack
  b3*       This equates the number 39 = 13*3 (in ASCII, ')
     l    Get the size of the stack
      \   Repeat the next character for as many times as the top item of the stack specifies.
       O  Output the current item of the stack, removing it after outputting it.'rd3*Z
'           Start recording as a string.

(wraps around once, capturing all the items)

'           Stop recording as a string. We now have everything recorded but the original ".
 r          Reverse the stack
  b3*       This equates the number 39 = 13*3 (in ASCII, ')
     Z      Output the entire stack.

Vitsy, 11 9 8 Bytes

This programming language was obviously made past the date of release for this question, but I thought I'd post an answer so I can a) get more used to it and b) figure out what else needed to be implemented.

'rd3*l\O

The explanation is as follows:

'rd3*l\O
'           Start recording as a string.

(wraps around once, capturing all the items)

'           Stop recording as a string. We now have everything recorded but the original ".
 r          Reverse the stack
  b3*       This equates the number 39 = 13*3 (in ASCII, ')
     l    Get the size of the stack
      \   Repeat the next character for as many times as the top item of the stack specifies.
       O  Output the current item of the stack, removing it after outputting it.

Vitsy, 11 9 8 6 Bytes

This programming language was obviously made past the date of release for this question, but I thought I'd post an answer so I can a) get more used to it and b) figure out what else needed to be implemented.

'rd3*Z

The explanation is as follows:

'rd3*Z
'           Start recording as a string.

(wraps around once, capturing all the items)

'           Stop recording as a string. We now have everything recorded but the original ".
 r          Reverse the stack
  b3*       This equates the number 39 = 13*3 (in ASCII, ')
     Z      Output the entire stack.
deleted 100 characters in body
Source Link
Addison Crump
Addison Crump
  • 11.2k
  • 1
  • 44
  • 90

Vitsy, 11 99 8 Bytes

This programming language was obviously made past the date of release for this question, but I thought I'd post an answer so I can a) get more used to it and b) figure out what else needed to be implemented.

'rd3*l\O;'rd3*l\O

Similar to how ><> and Befunge processes information, Vitsy wraps around a code line while executing. The explanation is as follows:

'rd3*l\O;'rd3*l\O
'           Start recording as a string.

(wraps around once, capturing all the items)

'           Stop recording as a string. We now have everything recorded but the original ".
 r          Reverse the stack
  b3*       This equates the number 39 = 13*3 (in ASCII, ')
     l    Get the size of the stack
      \   Repeat the next character for as many times as the top item of the stack specifies.
       O  Output the current item of the stack, removing it after outputting it.

Vitsy, 11 9 Bytes

This programming language was obviously made past the date of release for this question, but I thought I'd post an answer so I can a) get more used to it and b) figure out what else needed to be implemented.

'rd3*l\O;

Similar to how ><> and Befunge processes information, Vitsy wraps around a code line while executing. The explanation is as follows:

'rd3*l\O;
'           Start recording as a string.

(wraps around once, capturing all the items)

'           Stop recording as a string. We now have everything recorded but the original ".
 r          Reverse the stack
  b3*       This equates the number 39 = 13*3 (in ASCII, ')
     l    Get the size of the stack
      \   Repeat the next character for as many times as the top item of the stack specifies.
       O  Output the current item of the stack, removing it after outputting it.

Vitsy, 11 9 8 Bytes

This programming language was obviously made past the date of release for this question, but I thought I'd post an answer so I can a) get more used to it and b) figure out what else needed to be implemented.

'rd3*l\O

The explanation is as follows:

'rd3*l\O
'           Start recording as a string.

(wraps around once, capturing all the items)

'           Stop recording as a string. We now have everything recorded but the original ".
 r          Reverse the stack
  b3*       This equates the number 39 = 13*3 (in ASCII, ')
     l    Get the size of the stack
      \   Repeat the next character for as many times as the top item of the stack specifies.
       O  Output the current item of the stack, removing it after outputting it.
deleted 6 characters in body
Source Link
Addison Crump
Addison Crump
  • 11.2k
  • 1
  • 44
  • 90

Vitsy, 1111 9 Bytes

This programming language was obviously made past the date of release for this question, but I thought I'd post an answer so I can a) get more used to it and b) figure out what else needed to be implemented.

"r266*-l\O;'rd3*l\O;

Similar to how ><> and Befunge processes information, Vitsy wraps around a code line while executing. The explanation is as follows:


"r266*-l\O;'rd3*l\O;
"'           Start recording as a string.

(wraps around once, capturing all the items)

"'           Stop recording as a string. We now have everything recorded but the original ".
 r          Reverse the stack
  266*-b3*       This equates the number 3439 = 6*6-213*3 (in ASCII, "')
       l    Get the size of the stack
        \   Repeat the next character for as many times as the top item of the stack specifies.
         O  Output the current item of the stack, removing it after outputting it.
 

Vitsy, 11 Bytes

This programming language was obviously made past the date of release for this question, but I thought I'd post an answer so I can a) get more used to it and b) figure out what else needed to be implemented.

"r266*-l\O;

Similar to how ><> and Befunge processes information, Vitsy wraps around a code line while executing. The explanation is as follows:


"r266*-l\O;
"           Start recording as a string.

(wraps around once, capturing all the items)

"           Stop recording as a string. We now have everything recorded but the original ".
 r          Reverse the stack
  266*-     This equates the number 34 = 6*6-2 (in ASCII, ")
       l    Get the size of the stack
        \   Repeat the next character for as many times as the top item of the stack specifies.
         O  Output the current item of the stack, removing it after outputting it.
 

Vitsy, 11 9 Bytes

This programming language was obviously made past the date of release for this question, but I thought I'd post an answer so I can a) get more used to it and b) figure out what else needed to be implemented.

'rd3*l\O;

Similar to how ><> and Befunge processes information, Vitsy wraps around a code line while executing. The explanation is as follows:

'rd3*l\O;
'           Start recording as a string.

(wraps around once, capturing all the items)

'           Stop recording as a string. We now have everything recorded but the original ".
 r          Reverse the stack
  b3*       This equates the number 39 = 13*3 (in ASCII, ')
     l    Get the size of the stack
      \   Repeat the next character for as many times as the top item of the stack specifies.
       O  Output the current item of the stack, removing it after outputting it.
Rollback to Revision 1
Source Link
Addison Crump
Addison Crump
  • 11.2k
  • 1
  • 44
  • 90
edited body
Source Link
Addison Crump
Addison Crump
  • 11.2k
  • 1
  • 44
  • 90
Source Link
Addison Crump
Addison Crump
  • 11.2k
  • 1
  • 44
  • 90