Skip to main content
Code Golf

Return to Answer

changed both 0=? to ?!
Source Link
torcado
torcado
  • 590
  • 2
  • 7

><>, 2119 + 2 (-v flag) - 25 = -24 bytes

l0=l?2f6+*v!2f4+*v
-1o;!?=0::<

test it here!test it here!

Thanks Cole for helping fix my errorsand Sp3000

First checks the stack length, if it's 0 put 2 on the stack. Multiplies it by 21 (code length), then outputs the unicode representation of that number and decrements it by 1, loops until 0. (you'll have to inspect the output to see the characters, since the browser won't display them)

><>, 21 + 2 (-v flag) - 25 = -2 bytes

l0=?2f6+*v
-1o;?=0::<

test it here!

Thanks Cole for helping fix my errors

First checks the stack length, if it's 0 put 2 on the stack. Multiplies it by 21 (code length), then outputs the unicode representation of that number and decrements it by 1, loops until 0. (you'll have to inspect the output to see the characters, since the browser won't display them)

><>, 19 + 2 (-v flag) - 25 = -4 bytes

l?!2f4+*v
-1o;!?::<

test it here!

Thanks Cole and Sp3000

First checks the stack length, if it's 0 put 2 on the stack. Multiplies it by 21 (code length), then outputs the unicode representation of that number and decrements it by 1, loops until 0. (you'll have to inspect the output to see the characters, since the browser won't display them)

it's fixed now
Source Link
torcado
torcado
  • 590
  • 2
  • 7

><>, 1421 + 2 (-v flag) - 25 = -72 bytes

e*vl0=?2f6+*v
1->1o;?=0::0=?;o<

test it here!test it here!

Gosh dangit, I thought i was quick enoughThanks Cole for the first ><> answer. But that doesn't really matterhelping fix my errors

TakesFirst checks the initial stack numberlength, multipliesif it's 0 put 2 on the stack. Multiplies it by 1421 (code length), then outputs the unicode representation of that number and decrements it by 1, loops until 0. (you'll have to inspect the output to see the characters, since the browser won't display them)

><>, 14 + 2 (-v flag) - 25 = -7 bytes

e*v
1->::0=?;o

test it here!

Gosh dangit, I thought i was quick enough for the first ><> answer. But that doesn't really matter

Takes the initial stack number, multiplies it by 14 (code length), then outputs the unicode representation of that number and decrements it by 1, loops until 0. (you'll have to inspect the output to see the characters, since the browser won't display them)

><>, 21 + 2 (-v flag) - 25 = -2 bytes

l0=?2f6+*v
-1o;?=0::<

test it here!

Thanks Cole for helping fix my errors

First checks the stack length, if it's 0 put 2 on the stack. Multiplies it by 21 (code length), then outputs the unicode representation of that number and decrements it by 1, loops until 0. (you'll have to inspect the output to see the characters, since the browser won't display them)

[Edit removed during grace period]
Source Link
torcado
torcado
  • 590
  • 2
  • 7
Source Link
torcado
torcado
  • 590
  • 2
  • 7