Draw an asterisk triangle

Question

Inspired by a task for programming 101 here's a task that hopefully isn't too easy or is a duplicate (kinda hard to search for things like this).

Input:

A positive integer n >= 1.

Output:

n lines of asterisks, where every new line has one asterisk more than the line before, and starting with one asterisk in the first line.

General rules:

This is code-golf, so shortest answer in bytes wins.
Since the course is taught in C++, I'm eager to see solutions in C++.

Test case (n=5):

*
**
***
****
*****

\$\begingroup\$ Not duplicate, just subset of Generate a right triangle. \$\endgroup\$ – manatwork Oct 10 '16 at 12:20 — manatwork, Oct 10 '16 at 12:20
\$\begingroup\$ Training spaces allowed on each line? \$\endgroup\$ – Luis Mendo Oct 10 '16 at 12:33 — Luis Mendo, Oct 10 '16 at 12:33
\$\begingroup\$ Is a trailing new line acceptable? \$\endgroup\$ – Fatalize Oct 10 '16 at 12:34 — Fatalize, Oct 10 '16 at 12:34
\$\begingroup\$ Is a leading newline allowed? \$\endgroup\$ – Riley Oct 10 '16 at 14:38 — Riley, Oct 10 '16 at 14:38
\$\begingroup\$ I don't see a reason why not. \$\endgroup\$ – Sickboy Oct 11 '16 at 11:35 — Sickboy, Oct 11 '16 at 11:35

DJMcMayhem · Accepted Answer · 2016-10-10 19:50:03Z

Brain-Flak, 81 bytes

78 bytes but three for the -A flag, which enables ASCII output.

{(({}[()])<>()){({}[()]<(((((()()()){}())){}{}){})>)}{}((()()()()()){})<>}<>{}

Try it online!

Brain-flak isn't the greatest language for ASCII-art, but it still managed to be somewhat short. Ish. Kinda.

Explanation:

While True:
{

(
Decrement counter
({}[()])

And move copy to other stack
<>())

Push N '*'s
{({}[()]<(((((()()()){}())){}{}){})>)}

Pop 0
{}

Push newline
((()()()()()){})

Move back to counter
<>

Endwhile
}

Move to other stack
<>

Pop an extra newline
{}

Conor O'Brien · Accepted Answer · 2016-10-11 00:34:50Z

2

Jolf, 7 bytes

This time, the builtin didn't let me win. Oh well.

―t0jj'*

Try it here!

Explanation

―t0jj'*
―t0     pattern: left-corner-base triangle
   j     with <input> height
    j    and <input> width.
     '*  comprised of asterisks

answered Oct 11 '16 at 0:34

Conor O'Brien

37.5k2 gold badges80 silver badges170 bronze badges

Add a comment |

rnso · Accepted Answer · 2016-10-11 02:23:09Z

2

Racket 47 bytes

(for((i(+ 1 n)))(displayln(make-string i #\*)))

Ungolfed:

(define (f n)
  (for ((i (+ 1 n)))                         ; (i 5) in 'for' produces 0,1,2,3,4 
    (displayln (make-string i #\*))))        ; #\* means character '*'

Testing:

(f 5)

Output:

*
**
***
****
*****

edited Oct 11 '16 at 2:23

answered Oct 10 '16 at 13:35

rnso

1,6356 silver badges8 bronze badges

Add a comment |

Numberknot · Accepted Answer · 2016-10-11 08:49:42Z

2

Java 7,72 70 bytes

Thanks to @kevin for shave it off by 2 bytes.

String f(int n,String s,String c){return n<1?c:f(--n,s+"*",c+s+"\n");}

Output

*
**
***
****
*****
******

edited Oct 11 '16 at 8:49

answered Oct 11 '16 at 7:52

Numberknot

9156 silver badges10 bronze badges

\$\begingroup\$ Nice approach, +1! Btw, you can golf it by 1 more byte by changing c+= to c+. \$\endgroup\$ – Kevin Cruijssen Oct 11 '16 at 8:41
\$\begingroup\$ I see you've removed both s+= and c+=. I tried the same thing, but now your output is incorrect and contains a leading new line. The s+= should remain and c+= can be c+ for the same output without leading empty line. If OP allows leading newlines then it's of course fine like this. \$\endgroup\$ – Kevin Cruijssen Oct 11 '16 at 9:22

Add a comment |

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

2

Ruby, 27 (or 24) bytes

(Thanks to m-chrzan for pointing out the miscounting.)

Returns a string.

->n{(1..n).map{|i|?**i}*$/}

the map makes an array of strings of * of increasing length. The *$/ takes the array and joins the elements to make a newline-separated string. If an array of strings is acceptable, these three bytes can be saved, scoring 24.

In test program

f=->n{(1..n).map{|i|?**i}*$/}
puts f[5]

edited Jun 17 '20 at 9:04

Community♦

1

answered Oct 10 '16 at 20:47

Level River St

23.8k4 gold badges34 silver badges99 bronze badges

\$\begingroup\$ I think arrays of strings are acceptable output by default. Also, I believe your current solution is only 27 bytes long, so it'll go down to 24 :D. \$\endgroup\$ – m-chrzan Oct 11 '16 at 12:07

Add a comment |

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

C++, 78 bytes

I don't know how there are 2 C++ answers that don't just do it with for loops. Very short and sweet this way:

void T(int n){for(int i=1;i<=n;i++){for(int j=0;j<i;j++)cout<<'*';cout<<'\n';}}

Full program

#include <iostream>

using namespace std;

void T(int n)
{
    for(int i = 1; i <= n; i++)
    {
        for(int j = 0; j < i; j++)
            cout << '*';
        cout << '\n';
    }
}

int main()
{
  T(5);
}

Edit: it is unclear to me whether to count the #include<iostream>, using namespace std, and/or std::whatever in calls. C/C++ answers all over this site seem to use both, and for the most part no one seems to care except for the occasional comment. If I need the std::, then +10. If I need the #include<iostream>, +18 (although GCC allows me to do without the basic includes, so maybe not that one)

416E64726577 · Accepted Answer · 2016-10-12 02:40:17Z

2

Java, 110 bytes

Not that short, but I really like having empty for loops.

String f(int n){String s="";for(int i=0;i<n;i++,s+=new String(new char[i]).replace("\0","*")+"\n"){}return s;}

answered Oct 12 '16 at 2:40

416E64726577

1231 silver badge5 bronze badges

Add a comment |

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

2

GameMaker Language, 68 bytes

a="*"for(i=2;i<=argument0;i++){a+="#"for(j=0;j<i;j++)a+="*"}return a

edited Jun 17 '20 at 9:04

Community♦

1

answered Oct 12 '16 at 15:10

Timtech

12.2k1 gold badge40 silver badges61 bronze badges

Add a comment |

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

2

Prolog, 60 58 56 bytes

g(N):-N<=0,put(*),g(N-1);!.
f(N):-N<=0,f(N-1),g(N),nl;!.

I'm not that familiar with Prolog, but I just gave it a shot. I'm sure it can be a lot shorter.

Put the code into a file, then load that file into swipl and run f(25). (or some other number).

EDIT: quotes can be left out in put statement
EDIT 2: changing =:= to <= saves 2 bytes. I tried inverting it, but that'd make it wait for a return for some reason.

edited Jun 17 '20 at 9:04

Community♦

1

answered Oct 12 '16 at 16:28

Sijmen Schoon

213 bronze badges

Add a comment |

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

Elixir, 81 bytes

&Enum.reduce(Enum.to_list(1..&1),"",fn(x,r)->r<>String.duplicate("*",x)<>"\n"end)

Anonymous function using the capture operator. Enum.reduce will iterate a list (the list is obtained by calling Enum.to_list on the range 1..n) and concatenate the return string r (which has been initialized with "") with a string made of x asterisks and a newline.

Full program with test case:

s=&Enum.reduce(Enum.to_list(1..&1),"",fn(x,r)->r<>String.duplicate("*",x)<>"\n"end)
IO.write s.(5)

Try it online on ElixirPlayground !

Connor D · Accepted Answer · 2016-10-13 16:40:44Z

2

Pyth, 10 8 Bytes

thanks to Jakube for helping me shave off the extra 2 bytes!

VQ*Np"*"

Try it

edited Oct 13 '16 at 16:40

answered Oct 10 '16 at 20:26

Connor D

913 bronze badges

\$\begingroup\$ FNU is the same thing as V. And you don't need that p, printing is implicit. \$\endgroup\$ – Jakube Oct 11 '16 at 15:54
\$\begingroup\$ without the p the code doesn't execute properly. It would print one less level than it should. \$\endgroup\$ – Connor D Oct 13 '16 at 16:39

Add a comment |

acrolith · Accepted Answer · 2016-10-15 00:27:15Z

2

Since the course is taught in C++, I'm eager to see solutions in C++.

C++, 123 bytes, Non-competing

(the joke here is to deliver a 'pure' c++ answer)

#include<string>
class X:public std::string{public:X(int i):std::string(i*(i+1)/2,'*'){for(;i--;)insert(i*(i+1)/2,"\n");}};

Test

edited Oct 15 '16 at 0:27

acrolith

3,8081 gold badge21 silver badges40 bronze badges

answered Oct 14 '16 at 22:20

user60119

Add a comment |

Anonymous No Lifer · Accepted Answer · 2016-10-20 18:36:57Z

Brainfuck, 129 bytes

I know there's already a shorter answer in brainfuck, however I wanted to create a program which could handle a multi-digit number input rather than either a single-digit input or a single ascii character input unlike the previous one posted.

,[>+++[->++++[-<<---->>]<]+>,]<-<<[<<]>>[<[->>++++++++++<<]>>>]+>>++++++++++>>++++++[-<+++++++>]<<<<<[>[->+>>.<<<]>>.<[-<+>]<+<-]

This is my first ever brainfuck program and it will work for any input between 0 and the maximum size of a single cell (traditionally 8 bits or 255) entered using the characters '0' to '9' (corresponding to ascii-values 048-057)

Explanation

The first part of this program, ,[>+++[->++++[-<<---->>]<]+>,], takes the input numbers as char values and removes 48 from each to make them equal to the numbers 0 to 9 rather than the char values of the numbers 0 to 9. It stores these in separate cells with a 1 in between each of them so that the start and end points can be found again.

The second part, <-<<[<<]>>[<[->>++++++++++<<]>>>], consolidates the separate values into one cell. This is why the maximum size of a cell controls how high a number can be.

The third section, +>>++++++++++>>++++++[-<+++++++>]<<<<<, is used to set up the other cells needed: one with the number of asterisks per line, one with the code for a linefeed and one with the code for an asterisk. There is also a blank cell left for working with later.

The remainder of the code, [>[->+>>.<<<]>>.<[-<+>]<+<-], is used to:

Output as many asterisks as necessary
Output a linefeed
Reset the value of the cell controlling the asterisks
Increment the control cell
Decrement the cell with the number until it equals 0

Geno Racklin Asher · Accepted Answer · 2016-10-24 15:48:37Z

05AB1E, 11 bytes

'*×.pD¦`r`»

Try it online!

Explanation: (Prints hourglass)

                  Implicit input - 5
'*                Asterisk character - stack = '*'
  ×               Repeat input times - stack = '*****'
   .p             Get prefixes       - stack = ['*', '**', '***', '****', '*****']
     D            Duplicate last element
                  STACK = ['*', '**', '***', '****', '*****'] , ['*', '**', '***', '****', '*****']
      ¦           Remove first element from final list
                  STACK = ['*', '**', '***', '****', '*****'] , ['**', '***', '****', '*****']
       `r`        Reverse 1 list and flatten both
                  STACK = '*****','****','***','**','*','**','***','****','*****'
          »       Join by newlines and implicitly print

For input 5, prints:

*****
****
***
**
*
**
***
****
*****

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

2

C++ 11, 65 bytes

Not including the include in the byte count.

#include<string>
using S=std::string;S g(int n){return n?g(n-1)+S(n,'*')+'\n':"";}

Usage:

std::cout << g(n) << std::endl;

edited Jun 17 '20 at 9:04

Community♦

1

answered Oct 25 '16 at 11:59

Karl Napf

4,2939 silver badges28 bronze badges

Add a comment |

Pete Arden · Accepted Answer · 2016-10-26 13:51:22Z

2

SQL, 153 Bytes

Golfed:

CREATE PROCEDURE P @n INT AS BEGIN DECLARE @a INT;SET @a=0;DECLARE @o VARCHAR(1000);SET @o='*'WHILE @a<@n BEGIN PRINT @o;SET @o=@o+'*'SET @a=@a+1;END;END

Ungolfed:

CREATE PROCEDURE P
@n INT 
AS 
BEGIN 
DECLARE @a INT;
SET @a=0;
DECLARE @o VARCHAR(1000);
SET @o='*'
WHILE @a<@n
    BEGIN 
    PRINT @o;
    SET @o=@o+'*'
    SET @a=@a+1;
END;
END

Testing:

EXEC P '6'

Output:

*
**
***
****
*****
******

edited Oct 26 '16 at 13:51

answered Oct 26 '16 at 13:38

Pete Arden

1,1615 silver badges9 bronze badges

1

\$\begingroup\$ Wow, that's awesome! :-) \$\endgroup\$ – Sickboy Oct 27 '16 at 7:41
\$\begingroup\$ @Sickboy thanks! :) My language of choice is normally C#, but someone beat me to it! :) \$\endgroup\$ – Pete Arden Oct 27 '16 at 9:22
\$\begingroup\$ just @ is also a legal variable name in SQL, might save a couple of bytes there, and you can set the variable values directly in the DECLARE like so DECLARE @a INT=0 and a lot of those ; are unnecessary \$\endgroup\$ – grabthefish Feb 20 '17 at 14:31
\$\begingroup\$ also VARCHAR(MAX) is 1 shorter \$\endgroup\$ – grabthefish Feb 20 '17 at 14:33

Add a comment |

Zatherz · Accepted Answer · 2016-10-26 21:04:54Z

2

Crystal, 31 bytes

n=5;(1..n).each{|x|puts "*"*x}

Output:

*
**
***
****
*****

Really demonstrates the beauty of Crystal/Ruby. n is the integer input, (1..n) is an inclusive range from 1 to n ([1, n]). .each is a method on Range that runs the provided block for every integer in the range.

answered Oct 26 '16 at 21:04

Zatherz

1114 bronze badges

Add a comment |

Community · Accepted Answer · 2017-04-13 12:39:16Z

2

Dip, 6 5 bytes

`**En

-1 byte thanks to Oliver

Explanation:

`**    Push "*" repeated input times
   E   Prefixes
    n  Join by newlines

edited Apr 13 '17 at 12:39

Community♦

1

answered Oct 26 '16 at 19:29

acrolith

3,8081 gold badge21 silver badges40 bronze badges

\$\begingroup\$ 5-byte version: ``**En` \$\endgroup\$ – Oliver Ni Oct 30 '16 at 16:55

Add a comment |

score 2 · Accepted Answer · 2016-10-31 16:03:03Z

2

C, 88 bytes / 53 bytes

Using C89.

g(a){a&&g(a-1);a<2||puts("");while(a--)putchar('*');}main(int a,char**v){g(atoi(v[1]));}

With whitespace for clarity:

g(a) {
    a && g(a-1);
    a<2 || puts("");
    while (a--) putchar('*');
}
main(int a, char** v) {
    g(atoi(v[1]));
}

Without main, this function is 53 bytes:

g(a){a&&g(a-1);a<2||puts("");while(a--)putchar('*');}

edited Oct 31 '16 at 16:03

answered Oct 31 '16 at 15:42

user61383

Add a comment |

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

2

python3, 58 57 bytes

print('\n'.join(['*'*(p+1)for p in range(int(input()))]))

Ungolfed:

rownums = int(input())
output = []
for i in range(rownums):
    currrow = "*" * (i+1) # 'i' * 5 == 'iiiii'
    output.append(currrow)
print('\n'.join(output))

edited Jun 17 '20 at 9:04

Community♦

1

answered Oct 30 '16 at 21:37

Moonchild

2611 silver badge9 bronze badges

Add a comment |

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

2

SmileBASIC, 30 bytes

INPUT N
FOR I=1TO N?"*"*I
NEXT

edited Jun 17 '20 at 9:04

Community♦

1

answered Feb 9 '17 at 16:19

12Me21

6,3801 gold badge18 silver badges37 bronze badges

Add a comment |

brander · Accepted Answer · 2017-02-11 19:52:57Z

2

Haskell 36 Bytes

Here is a version using map.

f="*":map('*':)f;g=unlines.(`take`f)

Input g 10 Output "*\n**\n***\n****\n*****\n******\n*******\n********\n*********\n**********\n"

Alternatives of interest might be:

38 Bytes

g n=id=<<scanl(\x y->'*':x)"*\n"[2..n]

38 Bytes

f="*\n":map('*':)f;g n=id=<<(n`take`f)

36

g n=id=<<(take n$iterate('*':)"*\n")

edited Feb 11 '17 at 19:52

answered Feb 11 '17 at 17:37

brander

1113 bronze badges

\$\begingroup\$ Anonymous functions are allowed, so you don't need the g=. \$\endgroup\$ – Laikoni Feb 11 '17 at 22:01

Add a comment |

Paul Kerrigan · Accepted Answer · 2017-02-22 16:24:18Z

2

k, 18 bytes

{-1@(1+!x)#\:"*";}

Explanation:

-1@ // prints to console

1+!x //returns list from 1 to x (implicit input)

#\:  //for each item in the prefixed list, "take" this many

"*" //asterisk string

answered Feb 22 '17 at 16:24

Paul Kerrigan

1895 bronze badges

1

\$\begingroup\$ @ isn't necessary, and you can use ' instead of \: for -2 bytes {-1(1+!x)#'"*";} \$\endgroup\$ – Thaufeki Nov 4 '18 at 5:32

Add a comment |

smls · Accepted Answer · 2017-02-22 17:15:15Z

Perl 6, 17 bytes

put(\*x++$)xx get

Full program that prints to stdout.
How it works:

    \*             # a Capture object that stringifies to the asterisk,
      x            # string-repeated by
       ++$         # a counter that starts at 1,
put(      )        # and printed followed by a newline.
           xx get  # Do all of that n times.

Invokes the put statement n times, each time printing the asterisk repeated by the counter variable ++$.

Perl 6, 21 bytes

{.put for \*Xx 1..$_}

A lambda that prints to stdout.
How it works:

{                   }  # A lambda.
          \*           # A Capture object that stringifies to the asterisk.
               1..$_   # Range from 1 to n.
            X          # Cartesian product of the two,
             x         # with the string repetition operator applied to each result.
 .put for              # Iterate over the strings, and print each followed by a newline.

Mitchell Spector · Accepted Answer · 2017-02-25 02:19:41Z

2

Bash + Unix utilities, 26 bytes

seq -f10^%f-1 $1|bc|tr 9 *

Output to stderr should be ignored.

Try it online!

The code above works on TIO since the working directory there has no visible files. If this needs to run in a directory that contains a visible file, change * to \* at the cost of one byte (27 bytes):

seq -f10^%f-1 $1|bc|tr 9 \*

edited Feb 25 '17 at 2:19

answered Feb 24 '17 at 21:27

Mitchell Spector

7,5411 gold badge13 silver badges34 bronze badges

Add a comment |

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

2

Terrapin logo, 67 bytes

to a :a
make "b 1 repeat :a[repeat :b[type "*]make "b b+1 pr "]
end

edited Jun 17 '20 at 9:04

Community♦

1

answered Feb 26 '17 at 4:15

adrian

1991 silver badge5 bronze badges

Add a comment |

aross · Accepted Answer · 2017-03-03 15:55:30Z

2

PHP, 43 34 31 28 bytes

Note: uses IBM 850 encoding (old favorite reinvented recently)

for(;$argn--;)echo$o.=~ı,~§;

Run like this:

echo 5 | php -nR 'for(;$argn--;)echo$o.=~ı,~§;';echo
> *
> **
> ***
> ****
> *****

Explanation

Iterates from N down to 0. Add an asterisk to $o for each iteration, then outputs $o and a newline.

Tweaks

Add an asterisk to $o for each iteration, and then output $o. Saves 9 bytes
Combined adding an asterisk to $o with outputting, saves 3 bytes
Saved 3 bytes by using $argn

edited Mar 3 '17 at 15:55

answered Oct 10 '16 at 14:19

aross

1,6138 silver badges12 bronze badges

\$\begingroup\$ @TheBitByte, does my answer qualify for your bounty? It yields an asterisk by binary negation of ı (in IBM-850 encoding, as noted) \$\endgroup\$ – aross Oct 17 '16 at 8:36
\$\begingroup\$ Well, as long as it's an actual asterisk, then fine, it does qualify, however it is longer than some other bounty answers here. \$\endgroup\$ – Buffer Over Read Oct 19 '16 at 18:41

Add a comment |

Chromozorz · Accepted Answer · 2017-03-06 02:08:38Z

K, 16 Bytes

 {-1(1+!x)#'"*"};

  {-1(1+!x)#'"*"}10;
* 
**
***
****
*****
******
*******
********
*********
**********

EDIT BELOW - adding explanation)

/Code     ---> explanation (pretend x is 3)
1+!x      ---> Numbers from 1 to 3
1 2 3#"*" ---> Take left many items of right ==> ("*";"**";"***")
-1x       ---> Print x to the console, if x is a list, each item is printed to a new line

example(notice the -1 printed at the bottom). 
     -1("*";"**";"***")
     *
     **
     ***
     -1
To silence the output(-1), put a semicolon after the expression e.g.
-1("Hello");
Hello

Community · Accepted Answer · 2017-04-13 12:39:13Z

2

Röda 0.12, 30 29 bytes, non-competing

h i{seq 1,i|{|j|print"*"*j}_}

This is my first try in this scripting language created by fergusq :D

This is a function. To run, use this:

h i{seq 1,i|{|j|print"*"*j}_}

main {
  h(5)
}

Ungolfed

h i{                         /* Define a function h with parameter i */
   seq 1,i                   /* Generate a sequence of numbers from 1 to i */
          |{             }_  /*  and pipe it to a for-loop */
            |j|              /*  where j is the number in the sequence*/
               print"*"*j    /*  and print an asterisk duplicated j times*/
}

edited Apr 13 '17 at 12:39

Community♦

1

answered Mar 6 '17 at 18:48

user41805

12.3k6 gold badges36 silver badges84 bronze badges

\$\begingroup\$ The ; after the anonymous function parameter list is not actually required in Röda 0.12. It's a bug in the interpreter, but since you've specified the answer to be 0.12, I think you can remove it. I have been thinking that I may let the bug be, as its a handy feature in code golf, but haven't decided anything yet. \$\endgroup\$ – fergusq Mar 7 '17 at 13:32
\$\begingroup\$ @fergusq Thanks for the tip! "It's not a bug, it's a feature!" \$\endgroup\$ – user41805 Mar 7 '17 at 14:38
\$\begingroup\$ Why is this non-competing? \$\endgroup\$ – The Fourth Marshal Sep 25 '20 at 1:29

Add a comment |

score 2 · Accepted Answer · 2017-07-21 13:21:21Z

2

Common Lisp, SBCL, 69 66 61 45 44 41 bytes

full program:

(dotimes(i(read))(format t"~v{*~}*
"i 1))

Explanation

(dotimes(i(read)) <-- loop from i=0 to i=INPUT-1
(format t"~v{*~}*
"i 1)) <-- loop, displaying i+1 asterisks per line

Ideas for improvement are welcomed.

edited Jul 21 '17 at 13:21

answered Feb 9 '17 at 13:01

user65167

Add a comment |

Draw an asterisk triangle

150 Answers 150

Brain-Flak, 81 bytes

Jolf, 7 bytes

Explanation

Racket 47 bytes

Java 7,72 70 bytes

Output

Ruby, 27 (or 24) bytes

C++, 78 bytes

Full program

Java, 110 bytes

GameMaker Language, 68 bytes

Prolog, 60 58 56 bytes

Elixir, 81 bytes

Pyth, 10 8 Bytes

C++, 123 bytes, Non-competing

05AB1E, 11 bytes

C++ 11, 65 bytes

SQL, 153 Bytes

Crystal, 31 bytes

Dip, 6 5 bytes

C, 88 bytes / 53 bytes

python3, 58 57 bytes

SmileBASIC, 30 bytes

k, 18 bytes

Perl 6, 17 bytes

Perl 6, 21 bytes

Bash + Unix utilities, 26 bytes

Terrapin logo, 67 bytes

PHP, 43 34 31 28 bytes

Explanation

Tweaks

K, 16 Bytes

Röda 0.12, 30 29 bytes, non-competing

Ungolfed

Common Lisp, SBCL, 69 66 61 45 44 41 bytes

Explanation

Your Answer

Sign up or log in

Post as a guest

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

Linked

Related

Hot Network Questions