Extendify the ASCII Sun

Question

Write a program that takes in (via STDIN/command line) a non-negative integer N.

When N is 0, your program should print O (that's capital Oh, not zero).

When N is 1, your program should print

\|/
-O-
/|\

When N is 2 your program should print

\ | /
 \|/
--O--
 /|\
/ | \

When N is 3 your program should print

\  |  /
 \ | /
  \|/
---O---
  /|\
 / | \
/  |  \

For larger N, this pattern continues on in the same exact fashion. Each of the eight rays of the "sun" should be made of N of the appropriate -, |, /, or \ characters.

Details

Instead of a program, you may write a function that takes an integer. The function should print the sun design normally or return it as a string.
You must either
- have no trailing spaces at all, or
- only have enough trailing spaces so the pattern is a perfect (2N+1)*(2N+1) rectangle.
The output for any or all N may optionally have a trailing newline.

Scoring

The shortest code in bytes wins.

Is a leading newline allowed? Especially interesting for N=0. — Jakube, Commented May 7, 2015 at 23:10

Zach Gates · Accepted Answer · 2015-05-08 18:53:49Z

1

Python 3, 193 186 bytes

Golfed

def f(n):
 s,b,e,d,g=' \\/|-';p,r,i='',int(n),0
 while r:print(s*i+b+s*(r-1)+d+s*(r-1)+e);r-=1;i+=1
 print(g*n+'O'+g*n);r+=1;i=n-1
 while r<n+1:print(s*i+e+s*(r-1)+d+s*(r-1)+b);r+=1;i-=1

Output

>>> f(3)
\  |  /
 \ | /
  \|/
---O---
  /|\
 / | \
/  |  \

>>> f(5)
\    |    /
 \   |   /
  \  |  /
   \ | /
    \|/
-----O-----
    /|\
   / | \
  /  |  \
 /   |   \
/    |    \

Ungolfed

def f(n):
    s, b, e, d, g = ' \\/|-'
    p, r, i = '', int(n), 0
    while r:
        print(s*i + b + s*(r-1) + d + s*(r-1) + e)
        r -= 1
        i += 1
    print(g*n + 'O' + g*n)
    r += 1
    i = n-1
    while r < n+1:
        print(s*i + e + s*(r-1) + d + s*(r-1) + b)
        r += 1
        i -= 1

edited May 8, 2015 at 18:53

answered May 8, 2015 at 18:13

Zach Gates

6,69029 silver badges75 bronze badges

1

\$\begingroup\$ There's a few things to be golfed here, but the biggest one is your default arguments. s=' ',b='\\',f='/',d='|',g='-' is very long, so you'd be better off moving it by adding s,b,f,d,g=" \/|-" to the second line. \$\endgroup\$
– Sp3000
Commented May 8, 2015 at 18:28
\$\begingroup\$ I meant " \/|-" as a single string, rather than splitting it up into individual chars. You can unpack from a string like x,y,z="123", which makes x="1", y="2" and z="3". \$\endgroup\$
– Sp3000
Commented May 8, 2015 at 18:34
\$\begingroup\$ Edited again. Thanks @Sp3000 \$\endgroup\$
– Zach Gates
Commented May 8, 2015 at 18:39

Add a comment |

Claudiu · Accepted Answer · 2015-05-08 21:02:27Z

1

CJam, 59 55 bytes

ri:A,W%{_S*"\|/"\*\A\-(S*_@@++}%_Wf%W%['-A*_'O\++]\++N*

This won't win any awards as-is but I was happy enough it worked!

Thanks to Sp3000 for golfing tips.

edited May 8, 2015 at 21:02

answered May 8, 2015 at 19:20

Claudiu

4,0201 gold badge21 silver badges26 bronze badges

1

\$\begingroup\$ Nice work! Here's a few tips: 1) You can use S instead of the ' version for space and 2) For '-A*'O'-A you can do '-A*_'O\ instead because generating it twice is long \$\endgroup\$
– Sp3000
Commented May 8, 2015 at 19:46

Add a comment |

Tim · Accepted Answer · 2015-05-09 12:14:19Z

1

Python, 175 129 127 125 Bytes

s,q,x=' ','',int(input())
for i in range(x):d=(x-i-1);q+=(s*i+'\\'+s*d+'|'+s*d+'/'+s*i+'\n')
print(q+'-'*x+'O'+'-'*x+q[::-1])

Try it online here.

edited May 9, 2015 at 12:14

answered May 8, 2015 at 12:41

Tim

2,88918 silver badges34 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

Ruby - 130 bytes

def f(n);a=(0...n).map{|i|' '*i+"\\"+' '*(n-1-i)+'|'+' '*(n-1-i)+'/'+' '*i};puts(a+['-'*n+'O'+'-'*n]+a.reverse.map(&:reverse));end

usage:

irb(main):002:0> f(3)
\  |  /
 \ | /
  \|/
---O---
  /|\
 / | \
/  |  \

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered May 8, 2015 at 7:21

Tomáš Dundáček

1213 bronze badges

1

\$\begingroup\$ Applied a couple of old trick: f=->n{a=(0...n).map{|i|(s=' ')*i+?\\+s*(m=n-1-i)+?|+s*(m)+?/+s*i};puts(a+[?-*n+'O'+?-*n]+a.reverse.map(&:reverse))} (See Tips for golfing in Ruby for some more.) \$\endgroup\$
– manatwork
Commented May 8, 2015 at 16:22

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

JavaScript (ES6), 142 140 134 117 bytes

n=>(g=x=>x?`${t=` `[r=`repeat`](n-x--)}\\${s=` `[r](x)}|${s}/${t}
`+g(x):`-`[r](n))(n)+`O`+[...g(n)].reverse().join``

Try It

f=
n=>(g=x=>x?`${t=` `[r=`repeat`](n-x--)}\\${s=` `[r](x)}|${s}/${t}
`+g(x):`-`[r](n))(n)+`O`+[...g(n)].reverse().join``
i.addEventListener("input",_=>o.innerText=f(+i.value))
o.innerText=f(i.value=1)

<input id=i type=number><pre id=o>

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered May 8, 2017 at 10:42

Shaggy

43.5k4 gold badges36 silver badges94 bronze badges

Add a comment |

mazzy · Accepted Answer · 2018-11-05 18:46:58Z

Powershell, 108 97 93 bytes

filter f{try{$s=' '*--$_
"\$s|$s/"
$_|f|%{(" $_ ","-$_-")[$_-match'O']}
"/$s|$s\"}catch{'O'}}

Explanation:

the recursive algorithm throws an exception on $s=' '*--$_ when current number less then 1;
the output is a perfect rectangle with trailing spaces.

Less golfed test script:

filter f{
    try{
        $s=' '*--$_
        "\$s|$s/"
        $_|f|%{(" $_ ","-$_-")[$_-match'O']}
        "/$s|$s\"
    }catch{
        'O'
    }
}

@(

,(0,"O")
,(1,"\|/",
    "-O-",
    "/|\")
,(2,"\ | /",
    " \|/ ",
    "--O--",
    " /|\ ",
    "/ | \")
,(3,"\  |  /",
    " \ | / ",
    "  \|/  ",
    "---O---",
    "  /|\  ",
    " / | \ ",
    "/  |  \")

) | % {
    $n,$expected = $_
    $result = $n|f
    "$result"-eq"$expected"
    $result
}

Output:

True
O
True
\|/
-O-
/|\
True
\ | /
 \|/ 
--O--
 /|\ 
/ | \
True
\  |  /
 \ | / 
  \|/  
---O---
  /|\  
 / | \ 
/  |  \

Shaggy · Accepted Answer · 2021-06-21 15:13:47Z

Japt, 26 25 bytes

Pub golfing so, as usual, could probably be shorter.

Æ"\\|/"¬qXçÃÔp'OiUç-¹·ê û

Try it

Æ"\\|/"¬qXçÃÔp'OiUç-¹·ê û     :Implicit input of integer U
Æ                             :Map each X in the range [0,U)
 "\\|/"¬                      :  Split the string "\|/"
        q                     :  Join with
         Xç                   :    X spaces
           Ã                  :End map
            Ô                 :Reverse
             p                :Push
              'Oi             :  "O" prepended with
                 Uç-          :    "-" repeated U times
                    ¹         :End push
                     ·        :Join with newlines
                      ê       :Palindromise
                        û     :Centre pad each line with spaces to the length of the longest

matteo_c · Accepted Answer · 2024-04-14 10:10:58Z

1

C (GCC), 95 bytes

i;j;main(n){for(i=-++n;++i<n;puts())for(j=-n;++j<n;)putchar(i?j?i-j?i+j?32:47:92:124:j?45:79);}

Attempt This Online!

Takes input as argc. Note that argc can be zero on a POSIX system.

Two bytes can be saved (s/++n/n/) if the input is incremented by one, i.e. N+1 is given instead of N.

answered Apr 14 at 10:10

matteo_c

6,96015 silver badges28 bronze badges

Add a comment |

Aaron · Accepted Answer · 2024-04-14 18:47:35Z

Jelly, 48 43 bytes

AS$_/SḢṪ5ƭ
Wẋ5Ç=0Ɗ€
ŒRµ,þµÇi1Ɗ€€ị“O\/|- ”Y

Through multiple modifications this basically reduced to be ports of similar answers: exploding the matrix and running a couple of checks through it. Figured I'd post anyway because 1) there was no other Jelly answer and 2) I finally figured out the 'tie' quick.

AS$_/SḢṪ5ƭ    # The collection of checks to run against each element
AS$           # Sum of absolute values -> [0,0], "O"
   _/         # Difference -> [-x,-x] or [x,x], "\"
     S        # Sum -> [-x,x] or [x,-x], "/"
      Ḣ       # First element -> [0,x], "-"
       Ṫ      # Last element -> [x,0], "|"
        5ƭ    # Tie all five of those together

Wẋ5Ç=0Ɗ€      # Helper makes 5 copies of each element,
              # one to run each of the previous checks through
Wẋ5           # Make five copies of the given array
   Ç=0        # Run the above helper and compare each result to 0
      Ɗ€      # Run the zero check against each element passed in
          
ŒRµ,þµÇi1Ɗ€€ị“O\/|- ”Y
ŒRµ                          # Explode the arg, 1 -> [-1, 0, 1]
   ,þµ                       # Make a table/matrix of all combos
         Ɗ€€                 # For each row, for each column
      Ç                      # Call above helper link
       i1                    # and find the first 1

            
Now all the values are [0..5] so they can be indexed:
            ị“O\/|- ”   # Index each element into this string
                        # with zero wrapping to the last element
                     Y  # Join with linefeeds for final display

+1 for the explanation, but I must say, this is pretty long — Jelly is a shorter version of J, and the J solution is 10 bytes shorter! — noodle person, Commented Apr 14 at 2:23
I know! I was surprised as well! I didn't want to review the J answer too in depth until I made mine (as to not just be porting it). Now I think my binary indexing is overly complicated, so time to golf that away. — Aaron, Commented Apr 14 at 18:22
You also might find success going off of my Uiua solution, though certain parts might not translate perfectly to Jelly. I’m planning to learn Jelly so maybe I’ll try this problem in it as well. — noodle person, Commented Apr 14 at 18:44
Yes, @noodleman, your answer led to my discovery of Uiua which I stayed up late starting to learn, so thanks for posting that! — Aaron, Commented Apr 14 at 18:48

Xcali · Accepted Answer · 2024-10-17 19:06:41Z

1

Perl 5 `-n`, 71 69 bytes

70 68 bytes of code + 1 for -n (as was the style at the time)

//&say map$_?$_-$'?$_+$'?$'?$":'-':'/':'\\':$'?'|':O,@;for@;=-$_..$_

Try it online!

edited Oct 17 at 19:06

answered Apr 22 at 17:00

Xcali

16.2k2 gold badges15 silver badges39 bronze badges

\$\begingroup\$ > as was the style at the time \$\endgroup\$
– Dom Hastings
Commented Apr 25 at 8:09
1

\$\begingroup\$ @DomHastings I always keep a towel nearby and an onion on my belt. \$\endgroup\$
– Xcali
Commented Apr 25 at 18:08

Add a comment |

guest4308 · Accepted Answer · 2024-12-13 18:35:21Z

sed `-rn`, 132 126 124 122 121 bytes

s/^0/O/p               # if input is 0, swap to O and print
t                      # if success, quit
s/[^ ]*/echo {1..&}/e  # swap to 'echo {1..N}' and execute
s///g                  # delete all but spaces (makes N-1 spaces)
s%.*%\\&|&/%p          # swap ALL for \MATCH|MATCH/ and print
:a                     # define label 'a'             (start of main loop)
s%(\\)? (/)?%\2 \1%gp  # move slashes and print                          |
h                      # copy PATTERN space to HOLD space                |
y/ /-/                 # change spaces to dashes                         |
s%\\\|/%-O-%p          # if there's a '\|/' change it to '-O-' and print |
x                      # swap HOLD and PATTERN spaces                    |
s%%/|\\%p              # reuse prev. pattern & change to '/|\' and print |
/^\//!ba               # branch to label 'a'            (end of main loop)

Try it online!

the real engine of this answer, s%(\\)? (/)?%\2 \1%gp, was taken from this sed answer. it finds any ' /' or '\ ' and swaps them out for '/ ' and ' \' respectively, moving the right slashes in the right directions. I was hoping to use \ch but apperently TIO does not support ^H as a backspace and prints out a literal \x08 char

alyx-brett · Accepted Answer · 2015-05-14 22:17:03Z

0

Perl 85 91 90 89 86B

map{$_=$r||O;s/^|$/ /mg;s/ (-*O-*) /-$1-/;$r="\\$s|$s/
$_
/$s|$s\\";$s.=$"}1..<>;say$r

Ungolfed:

# usage: echo 1|perl sun.pl

map {
    $_ = $r || O;  # no strict: o is "o". On the first run $r is not defined
    s/^|$/ /mg;    # overwriting $_ saves characters on these regexes
    s/ (-*O-*) /-$1-/;
    $r = "\\$s|$s/
$_
/$s|$s\\";         # Embedded newlines save 1B vs \n. On the first run $s is not defined.
    $s .= $"
} 1..<>;
say $r

edited May 14, 2015 at 22:17

answered May 8, 2015 at 9:36

alyx-brett

1,5638 silver badges14 bronze badges

Add a comment |

dbramwell · Accepted Answer · 2015-05-15 16:02:57Z

0

Groovy - 113

f={n->s=2*n+1;(1..s).each{r->(1..s+1).each{c->print c==r?n+1==r?"O":"\\":c==s-r+1?"/":c==n+1?"|":c>s?"\n":" "}}}

I think the ternary logic could probably be cleaned up to give a shorter answer...

answered May 15, 2015 at 16:02

dbramwell

2111 silver badge2 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

0

SmileBASIC, 87 bytes

INPUT N
FOR Y=-N TO N
FOR X=-N TO N?" \/|-     O"[(X==Y)+!(X+Y)*2+!X*3+!Y*4];
NEXT?NEXT

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Feb 5, 2017 at 23:07

12Me21

6,7211 gold badge22 silver badges40 bronze badges

Add a comment |

dzaima · Accepted Answer · 2019-01-26 21:08:37Z

0

Canvas, 14 bytes

╵⌐|＊⁸／＋↔ω↶ｎ┼O╋

Try it here!

answered Jan 26, 2019 at 21:08

dzaima

20.3k2 gold badges41 silver badges75 bronze badges

Add a comment |

Neil · Accepted Answer · 2019-01-27 10:28:31Z

Retina 0.8.2, 99 bytes

.+
$* X$&$*-
 ( *)X(-+)
$1\|/¶$2X$2¶$1/|\
+`^ ( *.)( *)
$1$2 | $2/¶$&
+` ( */)( *).+$
$&¶$1$2 | $2\

Try it online! Explanation:

.+
$* X$&$*-

Place the X and draw n -s to its right. This completes the output for n=0.

 ( *)X(-+)
$1\|/¶$2X$2¶$1/|\

If n>0 then copy the -s to the left, and add the first level of \|/ and /|\ around the X. This completes the output for n=1.

+`^ ( *.)( *)
$1$2 | $2/¶$&

Extend the \|/ upwards, removing a space of indent each time, adding it back on each side of the |.

+` ( */)( *).+$
$&¶$1$2 | $2\

Extend the /|\ downwards, removing a space of indent each time, adding it back on each side of the |.

emanresu A · Accepted Answer · 2021-06-20 09:54:53Z

0

Vyxal, 46 bytes

(\\n›↳⁰↲\|\/n›↲⁰↳Ṡ,)\O-?-,(\/n›↲⁰↳\|\\n›↳⁰↲Ṡ,)

Try it Online!

A mess that I can't be bothered fixing, at least for now.

answered Jun 20, 2021 at 9:54

emanresu A

44.4k5 gold badges101 silver badges240 bronze badges

Add a comment |

Stack Exchange Network

Extendify the ASCII Sun

Details

Scoring

47 Answers 47

Python 3, 193 186 bytes

Golfed

Output

Ungolfed

CJam, 59 55 bytes

Python, 175 129 127 125 Bytes

Ruby - 130 bytes

JavaScript (ES6), 142 140 134 117 bytes

Try It

Powershell, 108 97 93 bytes

Japt, 26 25 bytes

C (GCC), 95 bytes

Jelly, 48 43 bytes

Perl 5 `-n`, 71 69 bytes

sed `-rn`, 132 126 124 122 121 bytes

Perl 85 91 90 89 86B

Groovy - 113

SmileBASIC, 87 bytes

Canvas, 14 bytes

Retina 0.8.2, 99 bytes

Vyxal, 46 bytes

Your Answer

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

Linked

Hot Network Questions

Extendify the ASCII Sun

Details

Scoring

47 Answers 47

Python 3, 193 186 bytes

Golfed

Output

Ungolfed

CJam, 59 55 bytes

Python, 175 129 127 125 Bytes

Ruby - 130 bytes

JavaScript (ES6), 142 140 134 117 bytes

Try It

Powershell, 108 97 93 bytes

Japt, 26 25 bytes

C (GCC), 95 bytes

Jelly, 48 43 bytes

Perl 5 -n, 71 69 bytes

sed -rn, 132 126 124 122 121 bytes

Perl 85 91 90 89 86B

Groovy - 113

SmileBASIC, 87 bytes

Canvas, 14 bytes

Retina 0.8.2, 99 bytes

Vyxal, 46 bytes

Your Answer

Sign up or log in

Post as a guest

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

Linked

Related

Hot Network Questions

Perl 5 `-n`, 71 69 bytes

sed `-rn`, 132 126 124 122 121 bytes

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