Binary Slashes Display

Question

Given a positive integer (or alternatively, a string/list of bits of its binary representation) output it with this diagonal ASCII-art formation:

(output for 53 / 110101)

       \
     /\ \
     \ \
    \ \/
  /\ \
  \ \
 \ \/
\ \
 \

This output has the MSB at the bottom left. Alternatively, you may choose to output with the LSB at the bottom left.

The output may include any extra whitespace as long as that doesn’t impact the presentation of the image.

This is a code-golf competition, so the shortest code wins.

Neil · Accepted Answer · 2024-06-25 07:18:33Z

6

Charcoal, 23 17 bytes

ＦＳ¿Σι↗\«\↑/↗\»‖Ｍ↖

Try it online! Link is to verbose version of code. Takes input as a binary string. Explanation:

ＦＳ

Loop over each digit.

¿Σι

If it's a 1, then...

↗\

... output the bottom half of the 1, finishing with the cursor moved up and right.

«\↑/↗\»

Otherwise, draw the bottom half of the zero, finishing with the cursor moved up and right.

‖Ｍ↖

Reflect to complete the output.

Alternative solution, also 17 bytes:

ＦＳ«Ｆ¬Σι↑\¶/↗\»‖Ｍ↖

Try it online! Link is to verbose version of code. Explanation:

ＦＳ«

Loop over each digit.

Ｆ¬Σι

If it's a zero, then...

↑\¶/

... draw the \/ part.

↗\

Draw the bottom half of the 1 or complete the bottom half of the zero, finishing with the cursor moved up and right.

»‖Ｍ↖

Reflect to complete the output.

Edit: Saved 6 bytes by using ReflectMirror(:UpLeft); as suggested by @noodleman.

edited Jun 25 at 7:18

answered Jun 25 at 0:07

Neil

177k12 gold badges74 silver badges281 bronze badges

\$\begingroup\$ Nice solution! I initially posted this as a CMC in the TNB discord server, and somebody found a 20 byte Charcoal solution, and that takes the input as decimal, I wonder if you can find it? :) Hint: ReflectMirror(:UpLeft); \$\endgroup\$
– noodle person
Commented Jun 25 at 0:19
\$\begingroup\$ I found two solutions using ReflectMirror(:UpLeft);, but they weren't 20 bytes... \$\endgroup\$
– Neil
Commented Jun 25 at 7:19
\$\begingroup\$ Nice improvement! The person who had the original 20 bytes suggests using array input instead of string input to save another byte: Try it online! \$\endgroup\$
– noodle person
Commented Jun 25 at 10:47
\$\begingroup\$ Oh, you said input as decimal, well, in that case, it would cost two bytes to convert that to an array, but as you point out, the array then saves a byte, so it's still only 18 bytes, not 20: Try it online! \$\endgroup\$
– Neil
Commented Jun 25 at 12:43
\$\begingroup\$ I don’t understand your comment, I’m saying that this solution you wrote can be a byte shorter by taking the input as a list of binary digits rather than as a binary string. The other person’s original solution was 20 bytes by taking input as decimal or 18 bytes taking it as a binary string, so your solution is definitely shorter, they found the array-input improvement after looking at yours \$\endgroup\$
– noodle person
Commented Jun 25 at 15:46

| Show 1 more comment

squareroot12621 · Accepted Answer · 2024-06-25 12:25:33Z

4

Python 3.8 (pre-release), 263 243 229 226 225 187 168 151 150 bytes

-20 bytes by applying some small modifications.
-14 bytes by emanresu A.
-3 bytes by noodle person.
-75 bytes by ASCII-only.
-1 byte by noodle person.

…Okay, what—

def f(b,c=[]):
 for i in b:c+=[0,1,2][i::2]
 for i in range(l:=len(c),-1,-1):print(" "*i+"  /"[[0,*c][i]]+" \\"[i>0]+" \\"*(i<l)+"  /"[[*c,0,0][i+1]])

Try it online!

edited Jun 25 at 12:25

answered Jun 25 at 0:36

squareroot12621

1,1311 gold badge2 silver badges14 bronze badges

\$\begingroup\$ 229 \$\endgroup\$
– emanresu A
Commented Jun 25 at 6:01
\$\begingroup\$ Building on emanresu A's suggestion, you can alias range to r to save another 3 bytes. Try it online! \$\endgroup\$
– noodle person
Commented Jun 25 at 10:30
\$\begingroup\$ and another -1 \$\endgroup\$
– ASCII-only
Commented Jun 25 at 10:52
\$\begingroup\$ 187 \$\endgroup\$
– ASCII-only
Commented Jun 25 at 11:03
\$\begingroup\$ 168 \$\endgroup\$
– ASCII-only
Commented Jun 25 at 11:10

| Show 3 more comments

Conor O'Brien · Accepted Answer · 2024-06-25 03:27:39Z

3

J, 78 bytes

' \/'{~[:+&(+|:&.|.)/1 2([*Q=/~([+|.@Q=:i.@#@])*_ 1{~]>.~2-[)"{0,&;(0 1;0){~|.

Try it online!

Accepts input as a list of binary digits. Here's the expanded version I started with, which shows some of the symmetry:

b =: 1 1 0 1 0 1
mask =: 0,;(0 1;0){~|.b

e =: [ + i.@-@#@]
mK =: 2 e mask
mT =: 1 e mask

K =: 2 * (mK *_ 1{~mask) =/ i.#mask
T =: 1 * (mT           ) =/ i.#mask

echo ' \/' {~ (+|:&.|.) K+T

Try it online!

answered Jun 25 at 3:27

Conor O'Brien

40.2k3 gold badges91 silver badges180 bronze badges

Add a comment |

GammaFunction · Accepted Answer · 2024-06-28 02:20:41Z

Zsh, 88 bytes

for b;((b))&&L=(\ $^L \\$l)&&l=' \'||{L=('  '$^L '/\'$l '\ \');l=' \/' }
print -rl $L $l

Try it online!

Or add --rcexpandparam to remove the ^ for 86 bytes.

for bit;
    ((bit)) &&
        # prepend all but one of the previous lines with a space,
        # the last line prefixed with a '\'
        lines=(\ $^lines \\$last) &&
        # new last line is ' \'
        last=' \' ||
    {
        
        # prepend all but one of the previous lines with two spaces,
        # the last line prefixed with a '/\',
        # add '\ \' as the center of the zero
        lines=('  '$^lines '/\'$last '\ \')
        # new last line is ' \/'
        last=' \/'
    }
print -rl $lines $last

Arnauld · Accepted Answer · 2024-06-27 06:12:22Z

JavaScript (ES6), 102 bytes

Expects an integer and outputs with the LSB at the bottom left.

f=(n,i,p=`
`,b=n-~n>>i/2)=>b>1?f(n,b/2%2-~i,p+" ")+p+"/ "[b&1|i&1]+s[+!!i]+s+"/  "[b&2|i&1]:p+=s=" \\"

Try it online!

Commented

f = (          // f is a recursive function taking:
  n,           //   n = input integer
  i,           //   i = counter (initially undefined)
  p = `\n`,    //   p = prefix string
  b = n - ~n   //   b = n * 2 + 1 right shifted by floor(i / 2)
      >> i / 2 //
) =>           //
b > 1 ?        // if b is greater than 1:
  f(           //   do a recursive call:
    n,         //     pass n unchanged
    b / 2 % 2  //     add 2 to i if the bit #1 of b is set
    - ~i,      //     or 1 otherwise (*)
               //     (because zeros are twice as large as ones)
    p + " "    //     append a space to the prefix string p
  ) +          //   end of recursive call
  p +          //   append the prefix string p
  "/ "[        //   append a space if:
    b & 1 |    //     the target digit is a one
    i & 1      //     or i is odd (grid misalignment)
  ] +          //   or a "/" otherwise (the top of a zero)
  s[+!!i] +    //   append "\" if i > 0, or a space otherwise
               //   (top segment of previous digit)
  s +          //   append " \" (bottom segment of new digit)
  "/  "[       //   append a space if:
    b & 2 |    //     the target digit is a one
    i & 1      //     or i is odd (grid misalignment)
  ]            //   or a "/" otherwise (the bottom of a zero)
:              // else (end of recursion):
  p +=         //   append p
    s = " \\"  //   followed by " \" (top segment of MSB)

Graham · Accepted Answer · 2024-06-25 15:51:41Z

1

APL+WIN, 66 bytes

Prompts for bit vector. Index origin = 0

n←(⊂3 2⍴'  \  \'),⊂3 3⍴'/\ \ \ \'⋄(-⌽⍳⍴s)⊖(i,i)⍴((i←⍴s)*2)↑n[s←~⎕]

Try it online! Thanks to Dyalog Classic

answered Jun 25 at 15:51

Graham

6,8461 gold badge15 silver badges11 bronze badges

Add a comment |

Xcali · Accepted Answer · 2024-06-25 22:02:06Z

1

Perl 5 `-F`, 104 97 bytes

@;=((($b=$"x(length($;[0].=" \\".'/'x!$_)-3+$_))."/\\","$b\\".' \\'x!$_)[$_..1],@;)for@F;say for@

Try it online!

edited Jun 25 at 22:02

answered Jun 25 at 21:15

Xcali

16.2k2 gold badges15 silver badges39 bronze badges

Add a comment |

Jakque · Accepted Answer · 2024-07-06 08:53:20Z

1

Python 3.8 (pre-release), 120 118 bytes

def f(i):
 c=a,=["\n"]
 while i:c[0]+=" \\"+(x:=~i%2)*"/";c=[a+x*"/"+"\\",x*(a+"\\ \\")]+c;a+=-~x*" ";i//=2
 print(*c)

Try it online!

Output with a leading newline, some trailing whitespaces at the end of each line and with the least significant bit in the bottom left (LSB)

edited Jul 6 at 8:53

answered Jul 5 at 12:48

Jakque

2,7287 silver badges13 bronze badges

\$\begingroup\$ Nice solution! What does c=a,=["\n"] do? I've never seen that syntax for assignment in Python before. \$\endgroup\$
– noodle person
Commented Jul 6 at 17:23
1

\$\begingroup\$ @noodleperson It is a shorter version of c=["\n"];a="\n" \$\endgroup\$
– Jakque
Commented Jul 6 at 22:17

Add a comment |

TwilightSparkle · Accepted Answer · 2024-07-06 09:55:06Z

1

GolfScript, 82 81 76 75 bytes

{49='/\ \  \ \/ \ \ '10/=}%5/zip.3<{' ':a+}%\3>{a\+}%+zip.,.a*:b@*b\+\6+/n*

Try it online!

LSB at the bottom left.

edited Jul 6 at 9:55

answered Jul 2 at 7:26

TwilightSparkle

3,9461 gold badge17 silver badges33 bronze badges

1

\$\begingroup\$ Really nice, I was hoping for a GolfScript solution and this is a very cool way of doing it \$\endgroup\$
– noodle person
Commented Jul 2 at 10:53

Add a comment |

F. Hauri - Give Up GitHub · Accepted Answer · 2024-07-07 17:23:06Z

1

Pure bash 170

Reading other answers here and re-reading request, there is a version without integer to binary conversion:

l=${1//1};t=${#1};printf -vk '%*s' $[t+${#l}-1];p=;for((c=t;c--;)){
((${1:c:1}))&&echo "$k\ $p"&&p=\\||{
k=${k:1};echo "$k/\ $p"$'\n'"$k\ \\";p=\\/;};k=${k:1};};echo \ \\

Pure bash 204

Full version expecting integer as argument.

for((a=$1;a;a>>=1)){ s=$[a&1]$s;};l=${s//1} t=${#s};printf -vk '%*s' $[t+${#l}-1]
p=;for((c=t;c--;)){ ((${s:c:1}))&&echo "$k\ $p"&&p=\\||{
k=${k:1};echo "$k/\ $p"$'\n'"$k\ \\";p=\\/;};k=${k:1};};echo \ \\

edited Jul 7 at 17:23

answered Jul 7 at 15:52

F. Hauri - Give Up GitHub

3,18226 silver badges38 bronze badges

Add a comment |

Andrew Bayly · Accepted Answer · 2024-07-16 23:40:26Z

1

JavaScript (Node.js), 130 99 bytes

f=(n,p=`
`,q=`  `,k=` \\`)=>n?f(n>>1,p+(n&1?` `:`  `),n&1?k:`/\\`)+p+(n&1?q+k:` ${k+k+p+q+k}/`):p+q

Try it online!

edited Jul 16 at 23:40

answered Jul 15 at 8:34

Andrew Bayly

1,1993 silver badges5 bronze badges

Add a comment |

Stack Exchange Network

Binary Slashes Display

11 Answers 11

Charcoal, 23 17 bytes

Python 3.8 (pre-release), 263 243 229 226 225 187 168 151 150 bytes

J, 78 bytes

Zsh, 88 bytes

JavaScript (ES6), 102 bytes

Commented

APL+WIN, 66 bytes

Perl 5 `-F`, 104 97 bytes

Python 3.8 (pre-release), 120 118 bytes

GolfScript, 82 81 76 75 bytes

Pure bash 170

Pure bash 204

JavaScript (Node.js), 130 99 bytes

Your Answer

Not the answer you're looking for? Browse other questions tagged
code-golf
ascii-art
binary
or ask your own question.

Linked

Hot Network Questions

Binary Slashes Display

11 Answers 11

Charcoal, 23 17 bytes

Python 3.8 (pre-release), 263 243 229 226 225 187 168 151 150 bytes

J, 78 bytes

Zsh, 88 bytes

JavaScript (ES6), 102 bytes

Commented

APL+WIN, 66 bytes

Perl 5 -F, 104 97 bytes

Python 3.8 (pre-release), 120 118 bytes

GolfScript, 82 81 76 75 bytes

Pure bash 170

Pure bash 204

JavaScript (Node.js), 130 99 bytes

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golfascii-artbinary or ask your own question.

Linked

Related

Hot Network Questions

Perl 5 `-F`, 104 97 bytes

Not the answer you're looking for? Browse other questions tagged
code-golf
ascii-art
binary
or ask your own question.