Garden architecture - ASCII style

Question 1

We have a square 10x10 meter garden outside our house. We want to plant grass and make a terrace. We have decided how to divide the garden, but we haven't decided the ratio between amount of grass vs terrace.

We need help visualizing it, and ASCII-art is clearly the best way to do so.

Challenge:

Take an integer in the inclusive range [0, 100] (or optionally decimal [0, 1]) representing how many percent of the garden should be terrace.

One square meter of terrace will be represented by either a dash - or a bar |. One square meter of grass will be represented by a hash mark #.

If the amount of terrace is less than or equal to 50%, then the garden should be covered with bars, starting in the bottom left corner, and fill vertically, then horizontally.
If the amount of terrace is more than 50% then we want the decking to be the other way (dashes instead of bars), and starting in the bottom left corner, and fill horizontally, then vertically.

Examples:

N = 25%
||########
||########
||########
||########
||########
|||#######
|||#######
|||#######
|||#######
|||#######
N = 75%
##########
##########
-----#####
----------
----------
----------
----------
----------
----------
----------
N = 47%
||||######
||||######
||||######
|||||#####
|||||#####
|||||#####
|||||#####
|||||#####
|||||#####
|||||#####
N = 50%
|||||#####
|||||#####
|||||#####
|||||#####
|||||#####
|||||#####
|||||#####
|||||#####
|||||#####
|||||#####
N = 51%
##########
##########
##########
##########
-#########
----------
----------
----------
----------
----------
N = 0%
##########
##########
##########
##########
##########
##########
##########
##########
##########
##########
N = 100%
----------
----------
----------
----------
----------
----------
----------
----------
----------
----------

This is code-golf so the shortest code in bytes win. Standard rules regarding I/O. This is ASCII-art, so the output should look like the examples above. I.e. outputting ["|", "|" ...] is not OK.

Explanations are encouraged as always :)

Question 2

My first impression was that the two cases would just mean solving two separate golfing tasks, but there's common structure to be found that makes it worth sharing code between them.

Question 3

APL (Dyalog), 34 bytes

Anonymous prefix function expecting integer in range 0–100. Assumes ⎕IO (Index Origin) to be 0, which is default on many systems.

{'#-|'[⊖⍉⍣s⊢10 10⍴100↑⍵⍴1+s←50≥⍵]}

Try it online!

{...} lambda; ⍵ is argument:

'#-|[...] index the string with the following array:

50≥⍵ 1 if 50 is greater than or equal to argument, else 0

s← store in s (for small)

1+ increment

⍵⍴ cyclically reshape to argument-length

100↑ take the first hundred of that, padding with zeros

10 10⍴ reshape to ten rows and ten columns

⊢ yield that (separates s from 10 10)

⍉⍣s transpose if small

⊖ flip upside-down

Question 4

{'#-|'[⊖(⍉+⍨)⍣(⍵≤50)⊢⍵>⍎¨∘.,⍨⎕d]}

Question 5

Very close to my approach: {⊖⍉⍣c⊢10 10⍴(⍵/'-|'⊃⍨c←⍵≤50),100/'#'}

Question 6

@EriktheOutgolfer you only need 99/'#'

Question 7

@ngn oh right, ⍴

Question 8

@ngn That's quite different. Why don't you post it?

Question 9

J, (削除) 39, 38 (削除ここまで) 37 bytes

[:|.>&50|:'#-|'"0{~_10]100円{.]1ドル+51>]

How it works:

 _10]100円{.]1ドル+51>] - prepares a 10x10 array of 0, 1 or 2
 1+51>] - 1 if N<=50 otherwise 2
 ]$ - list of N copies of the above (1 or 2)
 100{. - the above list filled to 100 items with 0
 _10]\ - reshape the list to a 10x10 array
 '#-|'"0 - constant array of chars
 {~ - replaces each digit 0, 1 or 2 with #, - or | 
 >&50 - is N>50 ? 
 |: - if not, transpose the array
 (in fact |: here is rearrange axes
 0 - transpose
 1 - leave it intact) 
 |.@ - reverse the order ot the rows

Try it online!

Question 10

{. with an over the bounds argument is a nice trick.

Question 11

31 bytes: (]|.@|:_10{&'#|-'100円{.1+$)>&50

Question 12

@ FrownyFrog - Great code!

Question 13

@Jonah - Yes, it's very handy sometimes. I also tried _100{. which puts the fills at the beginning, but then I needed to reverse each row, so I gave it up.

Question 14

JavaScript (ES6), 84 bytes

Takes input as an integer in [0...100].

n=>(y=9,g=x=>~y?'|-#'[[x,y][k=n/51|0]*9+x+y<n?k:2]+[`
`[x-9]]+g(x++-9?x:!y--):'')(0)

Test cases

let f =
n=>(y=9,g=x=>~y?'|-#'[[x,y][k=n/51|0]*9+x+y<n?k:2]+[`
`[x-9]]+g(x++-9?x:!y--):'')(0)
;[25, 75, 47, 50, 51, 0, 100]
.forEach(n => O.innerText += n + '%:\n' + f(n) + '\n')

<pre id=O></pre>

Formatted and commented

n => ( // given the terrace percentage n
 y = 9, // and starting with y = 9
 g = x => // g = recursive function taking x:
 ~y ? // if y is greater than or equal to 0:
 '|-#'[ // pick the relevant character:
 [x, y][k = n / 51 | 0] // using k = 1 if n > 50, 0 otherwise
 * 9 + x + y // and comparing either 10 * x + y or 10 * y + x
 < n ? // with n; if we're located over the terrace area:
 k // append either '|' or '-'
 : // else:
 2 // append '#'
 ] + // end of character insertion
 [`\n`[x - 9]] + // append a linefeed if x == 9
 g(x++ - 9 ? x : !y--) // update (x, y) and do a recursive call
 : // else:
 '' // stop recursion
)(0) // initial call to g with x = 0

Question 15

Python 2, (削除) 121 (削除ここまで) (削除) 117 (削除ここまで) 116 bytes

def f(n):
 s=[('-|'[n<51]*n+'#'*100)[i*10:][:10]for i in range(10)]
 for l in[s,zip(*s)][n<51][::-1]:print''.join(l)

Try it online!

Question 16

I think [i*10:-~i*10] can be [i*10:][:10].

Question 17

@JonathanFrech Thanks :)

Question 18

Jelly, 23 bytes

<©51ị)|-ẋḷ""#ẋ3¤s5Z®¡ṚY

Try it online!

Change the number before Ç in the footer to change the input. Works as a monadic link in a program without command-line arguments, which is allowed.

Question 19

Very nice answer +1. 23 bytes as a monadic link (ȷ2 -> ³)

Question 20

I managed to get 24 bytes too, thought it might be a source of inspiration here too.

Question 21

@Mr.Xcoder I did think of that, but I'm not really sure if I can assume such a thing (would only work in niladic programs? hmm...)

Question 22

See this discussion I had with Dennis.

Question 23

SWI Prolog, 249 bytes

p(X):-write(X).
r(X,Y,G):-G=<50,10*X-Y+1=<G,p('|').
r(_,_,G):-G=<50,p('#').
r(X,Y,G):-(10-Y)*10+X>G,p('#').
r(_,_,_):-p('-').
l(_,11,_):-nl.
l(X,Y,G):-r(Y,X,G),Z is Y+1,l(X,Z,G).
a(10,G):-l(10,1,G).
a(Y,G):-l(Y,1,G),Z is Y+1,a(Z,G).
s(G):-a(1,G),!.

The solution is pretty straightforward. Procedure a creates rows, l writes chars to columns in a row and r decides what character should be printed out.

Question 24

G<51 should work instead of G<=50.

Question 25

MATL, 26 bytes

'|-#'100:i>~o10eG50>?!E]P)

Try it online! Or verify all test cases.

Explanation

'|-#' % Push this string
100: % Push array [1 2 ... 100]
i % Input a number and push it
>~ % Less than or equal (element-wise)? This transforms the
 % array into [true ... true false ... false]
o % Convert to double. True becomes 1, false becomes 0
10e % Rehaspe into 10-row matrix, in column-major order
G % Push input
50> % Greater than 50?
? % If so
 ! % Transpose
 E % Multiply by 2 (element-wise). So 0 remains as 0, and
 % 1 becomes 2
] % End
P % Flip vertically
) % Index into string, modularly. So 1 corresponds to '|',
 % 2 to '-', and 0 to '#'
 % Implicitly display

Question 26

Python 2, 85 bytes

T=j=10
n=input()+T
while j:print([(n-j)/T*'|',min(n-T*j,T)*'-'][n>60]+'#'*T)[:T];j-=1

Try it online!

In both cases each line is padded on the right by # to length 10, which lets us share that code between the two cases. The number 10 was used often enough that aliasing T=10 saved a decent number of bytes.

Question 27

Invalid! From input 51 and after, it misses a row.

Question 28

@EriktheOutgolfer Those edge cases.

Question 29

@EriktheOutgolfer Thanks, I think this fixes it?

Question 30

Looks like it's fixed.

Question 31

Ruby, (削除) 92 (削除ここまで) 82 bytes

->n{puts (r=0..9).map{|y|r.map{|x|n>(n>50?100-y*10+x:x*10+9-y)?"|-"[n/51]:?#}*''}}

Try it online!

How it works:

Every cell in the grid has a progressive number starting from the bottom left corner and proceeding horizontally or vertically depending on the value of n:

If n>50, the number is 100-y*10+x otherwise it's x*10+9-y

Question 32

Charcoal, 25 bytes

NθGTχ#↶F÷θχ⟦χ⟧%θχ¿›θ50‖T↖

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

Nθ Input integer into q
 G Draw filled polygon
 T Directions Right, Down, Left
 χ Size 10
 # Filled with `#`
 ↶ Rotate cursor left (now points up)
 F÷θχ Repeat q/10 times (integer divide)
 ⟦χ⟧ Print 10 `|`s and move to the next column
 %θχ Print (q mod 10) `|`s
 ¿›θ50 If q > 50
 ‖T↖ Reflect diagonally

Question 33

@StewieGriffin Oops, wrong diagonal. Sorry for not checking.

Question 34

That's actually 25 characters, but 61 bytes, isn't it?

Question 35

@ZeroOne Charcoal uses its own code page.

Question 36

Oh, I see! Thanks for the explanation. :)

Question 37

Husk, 24 bytes

↔?T†▼'-≤500S↑C10+R0'|∞'#

Try it online!

Explanation

↔?T†▼'-≤500S↑C10+R0'|∞'# Input is a number, say n=12
 ∞'# Infinite string of #s: "#######...
 + Prepend to it
 '| the character |
 R0 repeated n times: "||||||||||||####...
 C10 Cut to pieces of length 10: ["||||||||||","||##########","##..
 S↑ Take first 10 pieces.
 ? ≤500 If n is at most 50,
 T then transpose,
 †▼'- else take minimum with '-' for each character.
↔ Reverse, implicitly print separated by newlines.

Question 38

SOGL V0.12, 21 bytes

┐* #M*+Mm√H.M»>?H§┐┌ŗ

Try it Here!

Explanation:

┐* push a vertical bar repeated input times
 #M* push "#" repeated 100 times
 + add the two together
 Mm mold to a length of 100
 √ convert to a square
 H rotate clockwise
 .M»>? if the input is greater than 50
 H rotate the array clockwise again
 § reverse it horizontally
 ┐┌ŗ replace "|" with "-"

Question 39

dc, _{(削除) 210 (削除ここまで)} 197 bytes

[256r^1-255/]sx?dddI/dsT9r-sYI%ddIr-sqdsesm-I/sN[[lNlxx124*PIlN-lxx35*PIPlq1-dsq0<o]dsoxlN1+sNledsq0<oq]sJ50!<J[Ilxx35*PIPlY1-dsY0<E]sElY0<E[lmlxx45*PIlm-lxx35*PIP]sClTI>C[Ilxx45*PIPlT1-dsT0<Z]dsZx

Try it online!

Question 40

APL (Dyalog Classic), 33 bytes

f←{'#-|'[⊖(⍉+⍨)⍣(⍵≤50)⊢⍵>⍎ ̈∘.,⍨⎕d]}

Try it online!

based on Adám's answer

⎕d is the string '0123456789'

∘., Cartesian product

⍨ with itself

⍎ ̈ evaluate each - get a 10x10 matrix of 0..99

⍵> boolean matrix for where the argument ⍵ is greater

⊢ acts as separator

(⍉+⍨)⍣(⍵≤50) if ⍵≤50 double the matrix (+ with itself) and transpose (⍉)

⊖ vertical reverse

'#-|'[ ] index the string '#-|' with each element of the matrix

Question 41

This explanation is excellent, imho.

Question 42

q, 51 bytes

{-1@'reverse$[i;::;flip]10 10#@[100#"#";til x;:;"|-"i:x>50];}

Question 43

Retina, (削除) 72 (削除ここまで) 62 bytes

.+
$*|
T`|`-`.{51,}
$
100$*#
M!10`.{10}
O$s`(?<!-.*)\S
$.%`
O`

Try it online! Link includes test cases. Edit: Saved 10 bytes with some help from @MartinEnder. Explanation:

.+
$*|

Repeat | the given number of times

T`|`-`.{51,}

But if the input was at least 51, change them to -s.

$
100$*#

Append 100 #s.

M!10`.{10}

Split into 10 groups of 10, discarding anything left over.

O$s`(?<!-.*)\S
$.%`

If the the input was at least 51, transpose the result.

O`

Sort the result.

Alternative solution, also 62 bytes:

.+
$*|
T`|`-`.{51,}
$
100$*#
M!10`.{10}
O`
O$^s`\S(?!.*-)
$.%`

Sorting before transposing allows a byte saving on the condition for the transposition but costs a byte to get the result in the correct order.

Question 44

You don't need # on the first O stage, because $.%` will be at most 9. You can also save some byte by avoiding the loop at the cost of another sort stage at the end, like this: tio.run/##K0otycxL/… There's probably even a shorter way to rearrange the result of that M stage into the final shape.

Question 45

Ah yeah, for example you can move the plain O stage to right after the M stage, so that you can keep using a lookahead instead of a lookbehind.

Question 46

@MartinEnder Thanks for your hints; I was able to golf a few more bytes off.

Question 47

Python 2, (削除) 106 (削除ここまで) 103 bytes

n=input();x=n>50;k=x*81+10
while k>0:s='';exec"s+='|-##'[x::2][n<k];k+=x or 10;"*10;print s;k+=x*81-101

Try it online!

Question 48

PHP, 119+1 bytes

$r=str_pad("",100,"#");for($x=50<$n=$argn;$n--;)$r[90+($x?$n%10*2-$n:$n/10-$n%10*10)]="|-"[$x];echo chunk_split($r,10);

Run as pipe with -nR or try it online.

Question 49

Jelly, 24 bytes

3<51
ȷ2Ḷ<s5ZḤ$Ç¡Ṛị"-|#"Y

Try it online!

How it works

I use too many superscripts...

3<51 ~ Helper link.
3 ~ The input.
 < ~ Is smaller than
 51 ~ 51?
 ~ Yields 1 for truthy, 0 for falsy.
ȷ2Ḷ<s5ZḤ$Ç¡Ṛị"-|#"Y ~ Main link.
ȷ2 ~ 1e2 (i.e compressed 100).
 Ḷ ~ Lowered range. Yields [0, 100) ∩ Z.
 < ~ Is smaller than the input? (element-wise).
 s5 ~ Split into sublists of length 10.
 Ç¡ ~ Repeat <last link as a monad> times (either 1 or 0 times).
 ZḤ$ ~ Zip (transpose) and unhalve element-wise.
 Ṛ ~ Reverse.
 ị ~ Modular, 1-based indexing into...
 "-|#" ~ The literal string "-|#".
 Y ~ Join by newlines.

Question 50

R, 102 bytes

n=scan();m=matrix("#",y<-10,y);m[0:n]="if"(n<51,"|","-");write("if"(n>50,m[,y:1],t(m[y:1,])),"",y,,"")

Try it online!

Reads n from stdin and prints the garden to stdout.

Explanation:

n=scan() # read from stdin
m=matrix("#",10,10) # create 10x10 matrix of "#"
m[0:n]="if"(n<51,"|","-") # set the first n entries in m to the appropriate character
m="if"(n>50, # prepare for printing using write
 m[,10:1], # reverse m left to right
 t(m[10:1,])) # flip m top to bottom and transpose
write(m,"",10,,"") # write m to stdout in 10 columns with no separator

Adám Adám 31.7k4 gold badges130 silver badges292 bronze badges · Accepted Answer · 2017-11-24 08:30:37Z

APL (Dyalog), 34 bytes

Anonymous prefix function expecting integer in range 0–100. Assumes ⎕IO (Index Origin) to be 0, which is default on many systems.

{'#-|'[⊖⍉⍣s⊢10 10⍴100↑⍵⍴1+s←50≥⍵]}

Try it online!

{...} lambda; ⍵ is argument:

'#-|[...] index the string with the following array:

50≥⍵ 1 if 50 is greater than or equal to argument, else 0

s← store in s (for small)

1+ increment

⍵⍴ cyclically reshape to argument-length

100↑ take the first hundred of that, padding with zeros

10 10⍴ reshape to ten rows and ten columns

⊢ yield that (separates s from 10 10)

⍉⍣s transpose if small

⊖ flip upside-down

Very close to my approach: {⊖⍉⍣c⊢10 10⍴(⍵/'-|'⊃⍨c←⍵≤50),100/'#'}

Stack Exchange Network

Garden architecture - ASCII style

Challenge:

20 Answers 20

APL (Dyalog), 34 bytes

J, (削除) 39, 38 (削除ここまで) 37 bytes

JavaScript (ES6), 84 bytes

Test cases

Formatted and commented

Python 2, (削除) 121 (削除ここまで) (削除) 117 (削除ここまで) 116 bytes

Jelly, 23 bytes

SWI Prolog, 249 bytes

MATL, 26 bytes

Explanation

Python 2, 85 bytes

Ruby, (削除) 92 (削除ここまで) 82 bytes

How it works:

Charcoal, 25 bytes

Husk, 24 bytes

Explanation

SOGL V0.12, 21 bytes

dc, _{(削除) 210 (削除ここまで)} 197 bytes

APL (Dyalog Classic), 33 bytes

q, 51 bytes

Retina, (削除) 72 (削除ここまで) 62 bytes

Python 2, (削除) 106 (削除ここまで) 103 bytes

PHP, 119+1 bytes

Jelly, 24 bytes

How it works

R, 102 bytes

Your Answer

Sign up or log in

Post as a guest

Post as a guest

Hot Network Questions

Garden architecture - ASCII style

Challenge:

20 Answers 20

APL (Dyalog), 34 bytes

J, (削除) 39, 38 (削除ここまで) 37 bytes

JavaScript (ES6), 84 bytes

Test cases

Formatted and commented

Python 2, (削除) 121 (削除ここまで) (削除) 117 (削除ここまで) 116 bytes

Jelly, 23 bytes

SWI Prolog, 249 bytes

MATL, 26 bytes

Explanation

Python 2, 85 bytes

Ruby, (削除) 92 (削除ここまで) 82 bytes

How it works:

Charcoal, 25 bytes

Husk, 24 bytes

Explanation

SOGL V0.12, 21 bytes

dc, (削除) 210 (削除ここまで) 197 bytes

APL (Dyalog Classic), 33 bytes

q, 51 bytes

Retina, (削除) 72 (削除ここまで) 62 bytes

Python 2, (削除) 106 (削除ここまで) 103 bytes

PHP, 119+1 bytes

Jelly, 24 bytes

How it works

R, 102 bytes

Your Answer

Sign up or log in

Post as a guest

Post as a guest

Related

Hot Network Questions

dc, _{(削除) 210 (削除ここまで)} 197 bytes