Retro Typewriter Art

Statement

Goal

Back in the day, people had fun turning "recipes" into surprise images using typewriters.

Use the provided recipe to create a recognizable image.

Chunks in the recipe are separated by a space.
Each chunk will tell you either
nl meaning NewLine (aka Carriage Return)
~or~
how many of the character and what character

For example:
4z means zzzz
1{ means {
10= means ==========
5bS means \\\\\ (see Abbreviations list below)
27 means 77
123 means 333333333333
(If a chunk is composed only of numbers, the character is the last digit.)

So if part of the recipe is
2* 15sp 1x 4sQ nl
...that tells you to show

**               x''''

and then go to a new line.

Abbreviations used:
sp = space
bS = backSlash \
sQ = singleQuote '
and
nl = NewLine

Sources/references:
https://asciiart.cc
https://loriemerson.net/2013/01/18/d-i-y-typewriter-art/
https://www.youtube.com/watch?v=kyK5WvpFxqo

Input

string recipe

Output

string (multiple lines) to show the image the recipe creates

Constraints

5 ≤ Length of recipe ≤ 1000
There won't be any double quotes (") in the recipe
recipe will contain at least 1 nl

Example

Input

1sp 1/ 1bS 1_ 1/ 1bS nl 1( 1sp 1o 1. 1o 1sp 1) nl 1sp 1> 1sp 1^ 1sp 1< nl 2sp 3|

Output

 /\_/\
( o.o )
 > ^ <
  |||

Tags

Parsing, Ascii Art

Difficulty

Easy

Test cases

Simple cat Test

Input

1sp 1/ 1bS 1_ 1/ 1bS nl 1( 1sp 1o 1. 1o 1sp 1) nl 1sp 1> 1sp 1^ 1sp 1< nl 2sp 3|

Output

/\_/\ ( o.o ) > ^ < |||

Validator 1 Validator

Input

6sp 1* 5sp 1* nl 5sp 1* 1sp 1* 3sp 1* 1sp 1* nl 5sp 1* 1sp 1* 1sp 1* 1sp 1* 1sp 1* nl 5sp 1* 2sp 1* 1sp 1* 2sp 1* nl 4sp 1* 2sp 1^ 3sp 1^ 2sp 1* nl 4sp 1* 4sp 1^ 4sp 1* nl 5sp 1* 3sp 1^ 3sp 1* nl 6sp 2* 3sp 2* nl 4sp 1* 4sp 1* 4sp 1* nl 4sp 1* 9sp 1* nl 5sp 1* 7sp 1* nl 7sp 1* 3sp 1* nl 9sp 1*

Output

* * * * * * * * * * * * * * * * ^ ^ * * ^ * * ^ * ** ** * * * * * * * * * *

Spider Test

Input

18sp 1: nl 18sp 1: nl 7sp 2, 9sp 1: 9sp 2, nl 7sp 2: 9sp 1: 9sp 2: nl 2, 5sp 2: 9sp 1: 9sp 2: 5sp 2, nl 2: 5sp 2: 9sp 1: 9sp 2: 5sp 2: nl 1sp 1sQ 2: 1. 3sp 1sQ 2: 1. 6sp 1: 6sp 1. 2: 1sQ 3sp 1. 2: 1sQ nl 4sp 1sQ 2: 1. 2sp 1sQ 2: 1. 2sp 1_ 1/ 1~ 1bS 1_ 2sp 1. 2: 1sQ 2sp 1. 2: 1sQ nl 6sp 1sQ 2: 1. 2sp 3: 1/ 5sp 1bS 3: 2sp 1. 2: 1sQ nl 8sp 1sQ 5: 1( 7sp 1) 5: 1sQ nl 15sp 1bS 1sp 3_ 1sp 1/ nl 9sp 1. 5: 1/ 1` 3sp 1` 1bS 5: 1. nl 7sp 1. 2: 1sQ 3sp 1. 1: 1bS 1o 1sp 1o 1/ 1: 1. 3sp 1sQ 2: 1. nl 5sp 1. 2: 1sQ 3sp 1. 2: 2sp 1: 1sQ 1: 2sp 2: 1. 3sp 1sQ 2: 1. nl 3sp 1. 2: 1sQ 4sp 2: 1sQ 3sp 1sQ 1sp 1sQ 3sp 1sQ 2: 4sp 1sQ 2: 1. nl 2sp 2: 6sp 2: 13sp 2: 6sp 2: nl 2sp 2^ 6sp 2: 13sp 2: 6sp 2^ nl 10sp 2: 13sp 2: nl 10sp 2^ 13sp 2^

Output

: : ,, : ,, :: : :: ,, :: : :: ,, :: :: : :: :: '::. '::. : .::' .::' '::. '::. _/~\_ .::' .::' '::. :::/ \::: .::' ':::::( ):::::' \ ___ / .:::::/` `\:::::. .::' .:\o o/:. '::. .::' .:: :': ::. '::. .::' ::' ' ' ':: '::. :: :: :: :: ^^ :: :: ^^ :: :: ^^ ^^

Validator 2 Validator

Input

1sp 2/ 1bS 9sp 1/ 2bS nl 2| 1sp 1* 1sp 1bS 1sp 1. 1sp 1. 1sp 1/ 1sp 1* 1sp 2| nl 1sp 2bS 4_ 1bS 1X 1/ 4_ 2/ nl 2sp 1/ 1sp 1* 2sp 1/ 1O 1bS 2sp 1* 1sp 1bS nl 2sp 1bS 2_ 1/ 2sp 1sQ 2sp 1bS 2_ 1/

Output

//\ /\\ || * \ . . / * || \\____\X/____// / * /O\ * \ \__/ ' \__/

Hen night Test

Input

13sp 2x nl 12sp 1/ 1sp 1. 1| 1_ nl 11sp 1/ 1( 1_ 1) 1_ 1< nl 10sp 1/ 2sp 1( nl 1sp 2( 4_ 1. 1- 1sQ 4sp 1) nl 2sp 2bS 9sp 1/ nl 3sp 1bS 1sQ 1- 1. 1- 1. 1- 1sQ 1` 1/ nl 1sp 1_ 2sp 1bS 6_ 1/ nl 1( 1_ 1) 3sp 1_ 1| 1_ 1bS 1_ nl 16sQ

Output

xx / .|_ /(_)_< / ( ((____.-' ) \\ / \'-.-.-'`/ _ \______/ (_) _|_\_ ''''''''''''''''

Validator 3 Validator

Input

4sp 1, 1_ 5sp 1_ 1, nl 4sp 1| 2bS 3_ 2/ 1| nl 4sp 1| 1= 16 3sp 16 1= 1| nl 4sp 1bS 1= 1. 1_ 1Y 1_ 1. 1= 1/ nl 5sp 1) 2sp 1` 2sp 1( 4sp 1, nl 4sp 1/ 7sp 1bS 2sp 2( nl 4sp 1| 7sp 1| 3sp 2) nl 3sp 1/ 1| 1sp 1| 3sp 1| 1sp 1| 1bS 1_ 2/ nl 3sp 1bS 1| 1sp 1| 1. 1_ 1. 1| 1sp 1| 1/ 1- 1` nl 4sp 1sQ 1u 1sQ 3sp 1sQ 1u 1sQ

Output

,_ _, |\\___//| |=6 6=| \=._Y_.=/ ) ` ( , / \ (( | | )) /| | | |\_// \| |._.| |/-` 'u' 'u'

Winnie has head room Test

Input

nl 1sp 2_ 1( 1sp 1) 1_ nl 1( 6sp 1( 1o 4_ nl 1sp 1| 10sp 1| nl 1sp 1| 6sp 1( 2_ 1/ nl 3sp 1bS 5sp 1/ 3sp 3_ nl 3sp 1/ 5sp 1bS 2sp 1bS 3_ 1/ nl 1sp 1/ 4sp 1^ 4sp 1/ 5sp 1bS nl 1| 3sp 1| 2sp 1| 2_ 1| 1_ 1H 1U 2N 1Y 1sp 1| nl 1| 4sp 1bS 6_ 1) 4_ 1/ nl 1sp 1bS 9sp 1/ nl 3sp 1bS 5sp 1/ 1_ nl 4sp 1| 2sp 1( 1sp 2_ 1) nl 4sp 1( 4_ 1)

Output

__( )_ ( (o____ | | | (__/ \ / ___ / \ \___/ / ^ / \ | | |__|_HUNNY | | \______)____/ \ / \ /_ | ( __) (____)

Head room Validator 4 Validator

Input

Output

/ _ `_--/-/_ _ ~\/ / | . _ . |--\ _| # ( # ) / \ _ # / -_ _-~ -'--`-_ / . | | |~| |-----,,) -------- |_|_| _~__~__\

A foundation of 8's Test

Input

1sp 1[ 1] 1[ 1] 1[ 1] 1sp 1/ 2sQ 1bS 1sp 1[ 1] 1[ 1] 1[ 1] nl 2sp 1| 2: 1| 1sp 1/ 4_ 1bS 1sp 1| 2: 1| nl 2sp 1| 1[ 1] 1| 1_ 1| 4: 1| 1_ 1| 1[ 1] 1| nl 2sp 1| 6: 2_ 6: 1| nl 2sp 1| 5: 1/ 2| 1bS 5: 1| nl 2sp 1| 1: 1# 3: 4| 2: 1# 2: 1| nl 2sp 168 nl 1sp 88 2sp 88 nl 1sp 78 4sp 78

Output

[][][] /''\ [][][] |::| /____\ |::| |[]|_|::::|_|[]| |::::::__::::::| |:::::/||\:::::| |:#:::||||::#::| 8888888888888888 88888888 88888888 8888888 8888888

Lots of 8's Validator Validator

Input

1V 1a 1l 1i 1d 1a 1t 1o 1r nl 1sp 1[ 1] 1[ 1] 1[ 1] 1sp 1/ 2sQ 1bS 1sp 1[ 1] 1[ 1] 1[ 1] nl 2sp 1| 2: 1| 1sp 1/ 4_ 1bS 1sp 1| 2: 1| nl 2sp 1| 1[ 1] 1| 1_ 1| 4: 1| 1_ 1| 1[ 1] 1| nl 2sp 1| 6: 2_ 6: 1| nl 2sp 1| 5: 1/ 2| 1bS 5: 1| nl 2sp 1| 1: 1# 3: 4| 2: 1# 2: 1| nl 2sp 168 nl 3sp 67 2sp 66 nl 1V 1a 1l 1i 1d 1a 1t 1o 1r

Output

Validator [][][] /''\ [][][] |::| /____\ |::| |[]|_|::::|_|[]| |::::::__::::::| |:::::/||\:::::| |:#:::||||::#::| 8888888888888888 777777 666666 Validator

Minimalist Test

Input

1# nl

Output

Minimalist Validator Validator

Input

nl 1.

Output

Impossible triangle Test

Input

10sp 5_ nl 9sp 1/ 4sp 1/ 1bS nl 8sp 1/ 4sp 1/ 2sp 1bS nl 7sp 1/ 4sp 1/ 4sp 1bS nl 6sp 1/ 4sp 1/ 2sp 1/ 1bS 2sp 1bS nl 5sp 1/ 4sp 1/ 2sp 1/ 2sp 1bS 2sp 1bS nl 4sp 1/ 4sp 1/ 2sp 1/ 1bS 3sp 1bS 2sp 1bS nl 3sp 1/ 4sp 1/ 2sp 1/ 2sp 1bS 3sp 1bS 2sp 1bS nl 2sp 1/ 4sp 1/ 2_ 1/ 4_ 1bS 3sp 1bS 2sp 1bS nl 1sp 1/ 14sp 1bS 3sp 1bS 2sp 1bS nl 1/ 16_ 1bS 3sp 1bS 2sp 1bS nl 1bS 21_ 1bS 1sp 1/

Output

_____ / /\ / / \ / / \ / / /\ \ / / / \ \ / / /\ \ \ / / / \ \ \ / /__/____\ \ \ / \ \ \ /________________\ \ \ \_____________________\ /

Impossible triangle Validator Validator

Input

6sp 2_ nl 5sp 1/ 1_ 1/ 1bS nl 4sp 1/ 1sp 1/ 1bS 1sp 1bS nl 3sp 1/ 1sp 1/ 1sp 1/ 1bS 1sp 1bS nl 2sp 1/ 1sp 1/ 1sp 1/ 1bS 1sp 1bS 1sp 1bS nl 1sp 1/ 1sp 1/ 1_ 1/ 2_ 1bS 1sp 1bS 1sp 1bS nl 1/ 1_ 1/ 6_ 1bS 1_ 1bS 1/ 1bS nl 1bS 1_ 1bS 9_ 1bS 1/

Output

__ /_/\ / /\ \ / / /\ \ / / /\ \ \ / /_/__\ \ \ /_/______\_\/\ \_\_________\/

Alien Test

Input

6sp 1_ 7sp 1_ nl 5sp 1( 1_ 1bS 5sp 1/ 1_ 1) nl 7sp 2) 3sp 2( nl 5sp 1. 1- 7sQ 1- 1. 2sp nl 1sp 1/ 1^ 1bS 1/ 2sp 1_ 1. 3sp 1_ 1. 2sp 1bS 1/ 1^ 1bS nl 1sp 1bS 1( 3sp 1/ 2_ 1bS 1sp 1/ 2_ 1bS 3sp 1) 1/ nl 2sp 1bS 1, 2sp 1bS 1o 1_ 1/ 1_ 1bS 1o 1_ 1/ 2sp 1, 1/ nl 4sp 1bS 4sp 1( 1_ 1) 4sp 1/ nl 5sp 1` 1- 1. 1sQ 3= 1sQ 1. 1- 1sQ nl 6sp 2_ 1) 1sp 1- 1sp 1( 2_ 3sp nl 5sp 1/ 2sp 1` 3~ 1` 2sp 1bS nl 4sp 1/ 2sp 1/ 5sp 1bS 2sp 1bS nl 4sp 1bS 1sp 1: 7sp 1; 1sp 1/ nl 5sp 1bS 1| 2= 1( 1* 1) 2= 1| 1/ nl 6sp 1: 7sp 1: nl 7sp 1bS 2sp 1| 2sp 1/ nl 5sp 3_ 1) 1= 1| 1= 1( 3_ nl 4sp 1{ 4_ 1/ 1sp 1bS 4_ 1}

Output

_ _ (_\ /_) )) (( .-'''''''-. /^\/ _. _. \/^\ \( /__\ /__\ )/ \, \o_/_\o_/ ,/ \ (_) / `-.'==='.-' __) - (__ / `~~~` \ / / \ \ \ : ; / \|==(*)==|/ : : \ | / ___)=|=(___ {____/ \____}

Validator 8 Validator

Input

4sp 1, 5- 1. nl 3sp 1( 1sp 1< 1> 1sp 1< 1> 1sp 1) nl 4sp 1) 1_ 1sp 1W 1sp 1_ 1( nl 5sp 5| 4sp 1A 1sp 1A 1sp 1A nl 6sp 3| 5sp 1| 1sp 1| 1sp 1| nl 3sp 2_ 1/ 1) 1sQ 1( 1bS 2_ 2sp 1` 1- 1+ 1- 1sQ nl 2sp 1/ 2bS 5sp 2/ 1bS 3sp 1| nl 1sp 1| 1sp 1| 2bS 3_ 2/ 1bS 1sp 1bS 2sp 1| nl 1sp 1| 1sp 1| 1/ 2bS 1_ 2/ 1bS 1sp 1bS 1sp 1bS 1sp 1| nl 1sp 1| 1sp 2| 2bS 1_ 2/ 1| 2sp 1bS 1sp 1bS 1| nl 1sp 1| 1sp 2| 1/ 1bS 1_ 1/ 1bS 1| 3sp 1bS 1sp 1| nl 1sp 1| 1sp 1| 1/ 1sp 1/ 1| 1bS 1sp 1bS 4sp 1bS 1_ 1) nl 1sp 1( 1_ 1/ 2sp 1bS 1_ 1/ 2sp 1bS 4sp 1B nl 3sp 1| 2sp 1| 1sp 1| 2sp 1| 4sp 1A nl 3sp 1| 2sp 1| 1sp 1| 2sp 1| 4sp 1D nl 3sp 1| 1( 1) 1| 1sp 1| 1( 1) 1| 4sp 1N nl 3sp 1| 2sp 1| 1sp 1| 2sp 1| 4sp 1E nl 3sp 1| 2sp 1| 1sp 1| 2sp 1| 4sp 1W nl 3sp 1| 2_ 1| 1sp 1| 2_ 1| 4sp 1S nl 3sp 1bS 2_ 1/ 1sp 1bS 2_ 1/ 4sp 1|

Output

,-----. ( <> <> ) )_ W _( ||||| A A A ||| | | | __/)'(\__ `-+-' /\\ //\ | | |\\___//\ \ | | |/\\_//\ \ \ | | ||\\_//| \ \| | ||/\_/\| \ | | |/ /|\ \ \_) (_/ \_/ \ B | | | | A | | | | D |()| |()| N | | | | E | | | | W |__| |__| S \__/ \__/ |

Tree Test

Input

15sp 1O 1o 1* 1o 1O 1o 1O 1o nl 10sp 1o 1O 1o 1O 1* 1O 1o 1* 1o 1O 1o 1O 1o 1O 1o 1O 1@ 1o nl 8sp 1o 1O 1o 1O 1o 1O 18 1O 1o 1O 1@ 1o 1@ 1o 1O 1o 1O 1o 1O 1o nl 8sp 1o 1O 1o 1O 1@ 1O 1o 18 1o 1O 2o 1@ 1o 1O 1o 18 1@ 1O 1o 1O nl 7sp 2o 1O 1o 18 1o 1O 1o 1O 1o 1O 1@ 20 1O 1o 1O 1* 1O 1o 1O 1o 1O 1o nl 4sp 2o 1O 1o 1O 1o 1O 1@ 1O 1o 1O 1o 1O 1o 10 1o 1O 1@ 1O 1o 1O 1o 1O 1o 1O 1@ 1O 1o nl 2sp 2o 1O 1o 18 1o 1O 1o 1O 1o 1O 1o 1O 1@ 1O 1* 2o 1O 1o 18 1o 1O 1@ 1O 1o 1O 1o 1O 1o 1O 1o nl 2sp 1o 1O 1o 1O 1o 1O 1o 1* 18 1O 1o 1O 1o 1O 1o 1O 1o 1O 18 1O 1o 1O 1o 1O 1o 1O 1o 18 1o 1O 1o 1O nl 2sp 1* 2o 1O 2o 1O 2o 1O 2o 1O 2o 1@ 1* 2o 1O 2o 1O 18 1o 1O 2o 1O 2o 1* nl 6sp 1O 2sp 1* 2o 1O 1sp 1x 1sp 4X 1* 1O 1o 1* 2sp 1@ 2sp 1* 1o nl 11sp 1O 1o 2sp 1x 4X 1* 2o nl 16sp 2X 1@ 1X 1x nl 16sp 4X nl 16sp 4X nl 15sp 1x 5X 1x nl 13sp 1x 8X 1x nl 9sp 16X 1x nl 35=

Output

Oo*oOoOo oOoO*Oo*oOoOoOoO@o oOoOoO8OoO@o@oOoOoOo oOoO@Oo8oOoo@oOo8@OoO ooOo8oOoOoO@00OoO*OoOoOo ooOoOoO@OoOoOo0oO@OoOoOoO@Oo ooOo8oOoOoOoO@O*ooOo8oO@OoOoOoOo oOoOoOo*8OoOoOoOoO8OoOoOoOo8oOoO *ooOooOooOooOoo@*ooOooO8oOooOoo* O *ooO x XXXX*Oo* @ *o Oo xXXXX*oo XX@Xx XXXX XXXX xXXXXXx xXXXXXXXXx XXXXXXXXXXXXXXXXx ===================================

NYC Validator 9 Validator

Input

1sp 1W 19sp 2_ 2sp 2_ nl 1[ 1sp 1] 17sp 1| 2: 2| 2: 1| nl 1sp 1E 10sp 1. 1_ 1. 5sp 1| 2: 2| 2: 1| 3sp 1. 1_ 1. nl 1sp 1| 1bS 9sp 1| 1: 1| 1sp 1. 1_ 1. 1sp 1| 2: 2| 2: 1| 3sp 1| 1/ 1| nl 1sp 1bS 1sp 2bS 1| 1/ 5sp 1| 1: 1| 1_ 1| 1/ 1| 1sp 1| 2: 2| 2: 1| 1_ 2sp 1| 1/ 1| nl 2sp 1| 1- 1( 1sp 1) 1- 4sp 1| 1: 1| 1o 1| 1/ 1| 1_ 1| 2: 2| 2: 1| 1bS 1| 1_ 1| 1/ 1| 1sp 1_ nl 2sp 1| 1sp 1V 1sp 1L 5sp 1| 1: 1| 1o 1| 1/ 3| 2: 2| 2: 1| 1bS 3| 1/ 2| 1: 1| nl 2sp 1bS 4sp 1` 2sp 3_ 3sp 21~ nl 3sp 1| 4sp 1bS 1/ 2sp 1/ 6sp 4~ 1sp 4~ 1sp 3~ 1sp 3~

Output

W __ __ [ ] |::||::| E ._. |::||::| ._. |\ |:| ._. |::||::| |/| \ \\|/ |:|_|/| |::||::|_ |/| |-( )- |:|o|/|_|::||::|\|_|/| _ | V L |:|o|/|||::||::|\|||/||:| \ ` ___ ~~~~~~~~~~~~~~~~~~~~~ | \/ / ~~~~ ~~~~ ~~~ ~~~

Flamingo Fran Test

Input

4sp 2_ nl 2sp 1. 1^ 1o 1sp 1~ 1bS nl 1sp 1Y 1sp 1/ 1sQ 1~ 1) 1sp 1} 6sp 5_ nl 1sp 1l 1/ 2sp 1/ 1sp 1/ 4sp 1, 1- 1~ 5sp 2~ 2- 1. 1, 1_ nl 4sp 1( 1sp 1( 4sp 1/ 2sp 1~ 1- 1. 1_ 9sp 1^ 1. nl 5sp 1bS 1sp 1sQ 2- 1sQ 2- 1. 4sp 1sQ 1- 1. 1_ 7sp 1bS nl 6sp 1sQ 1- 1. 8_ 5sp 1~ 2- 1. 1, 2_ 1sp 1^ 1. nl 16sp 1sQ 1~ 1r 1- 1. 1, 3_ 1. 1- 1sQ 1- 1. 1sp 1^ 1. nl 17sp 1Y 1I 4sp 1bS 6sp 1~ 1- 1. 1bS nl 17sp 2| 5sp 1bS 8sp 1` 1bS nl 17sp 2| 5sp 2/ nl 17sp 2| 4sp 2/ nl 17sp 1( 1) 3sp 2/ nl 17sp 2| 2sp 2/ 4sp 1~ 1F 1r 1a 1n nl 17sp 2| 1sp 1( 1sp 1c nl 4sp 3_ 1. 1_ 1sp 2_ 2sp 3_ 1I 1| 2_ 1` 2- 2_ 1. 1_ 1sp 2_ 2sp 1_ nl 2sp 1sQ 1~ 5sp 1~ 2sp 1sQ 1~ 3sp 2: 2sp 2~ 2sQ 4sp 1~ 2sp 2~ nl 17sp 2: nl 17sp 1. 1: nl 18sp 1. nl 2sp 32~

Output

__ .^o ~\ Y /'~) } _____ l/ / / ,-~ ~~--.,_ ( ( / ~-._ ^. \ '--'--. '-._ \ '-.________ ~--.,__ ^. '~r-.,___.-'-. ^. YI \ ~-.\ || \ `\ || // || // () // || // ~Fran || ( c ___._ __ ___I|__`--__._ __ _ '~ ~ '~ :: ~~'' ~ ~~ :: .: . ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Validator 10 Validator

Input

8sp 1. 1sQ 1` 1sQ 1. nl 4sp 1. 1- 1. 1/ 1sp 1_ 1= 1_ 1sp 1bS 1. 1- 1. nl 3sp 1{ 2sp 1( 1, 1( 1o 1Y 1o 1) 1, 1) 1sp 2} nl 3sp 2{ 1sp 1| 3sp 1sQ 3sp 1| 1} 1sp 1} nl 3sp 1{ 1sp 1{ 1sp 1bS 1( 3- 1) 1/ 2sp 2} nl 3sp 2{ 2sp 1} 1sQ 1- 1= 1- 1sQ 1{ 1sp 1} 1sp 1} nl 3sp 1{ 1sp 1{ 1sp 1} 1. 1_ 1: 1_ 1. 1{ 2sp 2} nl 3sp 2{ 2sp 1} 1sp 1- 1: 1- 1sp 1{ 1sp 1} 1sp 1} nl 3sp 1{ 1_ 1{ 1sp 1} 1` 3= 1` 1{ 2sp 1_ 1} nl 2sp 4( 1bS 1) 5sp 1( 1/ 4) nl 21x

Output

.'`'. .-./ _=_ \.-. { (,(oYo),) }} {{ | ' |} } { { \(---)/ }} {{ }'-=-'{ } } { { }._:_.{ }} {{ } -:- { } } {_{ }`===`{ _} ((((\) (/)))) xxxxxxxxxxxxxxxxxxxxx

Solution language

Solution

Stub generator input

Rate this contribution

+14

Make the contribution public (lvl 20+)

Comments

19 Comments

5DN1L Unnamed CodinGamer

1 year ago

This guy is copying your puzzle as his clash: https://www.codingame.com/...

Lisa-Has-Ideas Unnamed CodinGamer

1 year ago

Yikes !! Why would someone do that??!!??

PewPewBewm Unnamed CodinGamer

almost 2 years ago

✅ Approved the contribution. Comment: A nice simple puzzle that will encourage those starting out. String handling is always good : )

Lisa-Has-Ideas Unnamed CodinGamer

almost 2 years ago

Thank you so much. I appreciate it !!!

FredericLocquet Unnamed CodinGamer

almost 2 years ago

✅ Approved the contribution. Comment: I think it is a VERY easy puzzle but you did a real job to carry out the tests it's very beautiful !

Lisa-Has-Ideas Unnamed CodinGamer

almost 2 years ago

Thank you so much !!!

Westicles Unnamed CodinGamer

almost 2 years ago

✅ Approved the contribution. Comment: Lots of love went into this one.

Lisa-Has-Ideas Unnamed CodinGamer

almost 2 years ago

Thank you so much for the Approval and the kind words :)

PerseverantDT Unnamed CodinGamer

almost 2 years ago

I suppose the WIP part here is the validators as they are essentially the same as the test cases except with the word "Validator" before and after the ASCII art. Would like to see that changed before approval. Besides that, pretty nice puzzle. It's easy to understand what to do and the test cases are well designed. Suggestions: - Format the statement better. ----- Samples of [[recipe]] and their outputs should be written as constants instead of enclosing them in quotation marks. ----- Same goes for the abbreviations; they should be written as constants instead of in boldface. - Change the constraint of [[recipe]]: The shortest valid length of [[recipe]] is 5 (1# nl).

Lisa-Has-Ideas Unnamed CodinGamer

almost 2 years ago

Thank you for all the feedback. The phrasing from https://www.codingame.com/... states "Each validator must differ from the corresponding test. It's only to ensure that the players don't hardcode the solution" and I think my validators do that. No? But I have actually written my own private program to translate images into recipes, so doing 4 more won't be hard, and so I will probably go ahead and do that. :) UPDATE : Done :) UPDATE: I added a bunch more tests/validators

Rafarafa Unnamed CodinGamer

almost 2 years ago

In 'A foundation of 8's' how am I supposed to read the chunk '168' ? I mean I know that it's supposed to be sixteen eights but why not 1 times 68... Sure you say: "25" means "55" "103" means "3333333333" but what to do with "1036" (I know this never happens). Should I print 10 times 36, 103 times 6 etc.? In other words, from where to where am I supposed to cut these types of chunks, explicitly ? For example, is the char always 1 digit max ?

Lisa-Has-Ideas Unnamed CodinGamer

almost 2 years ago

Thank you for the feedback. Yes, I'm glad you noticed that. I spent a lot of time trying to figure out the absolute shortest way to do notation in the "recipe". At one point I had a symbol like 10=3 to indicate to type "3" 10 times but then that caused a problem decoding an image when actual "=" symbols were in the image itself. Eventually I realized you don't need that because yes by definition, a character is 1 character (not sure the technical way to say that). So if a chunk is only digits (such as 25 or 103), you know that the last character is the character and all the ones to the left are "how many". In other words, if a chunk is only digits then the pattern is xy or xxy or xxxy or xxxxy etc where y is character and x is the "how many" To address your specific example: The recipe to print "36" 10 times (aka to print "36363636363636363636") is 13 16 13 16 13 16 13 16 13 16 13 16 13 16 13 16 13 16 13 16 I kind of like that this "complication" is part of it. In my opinion, that makes it qualify more as a "Classic Puzzle" than a "Clash"

ABOUT US CAREERS PRIVACY FAQ BLOG

The #1 tech hiring platform

SCREENING INTERVIEWING