![also try vvvvvv also try vvvvvv](https://v-phinf.pstatic.net/20200826_62/1598436662537hGIDe_JPEG/88714d67-e783-11ea-98da-505dac8c35ff_08.jpg)
⅛, Push it to the global array and print it Nd\>*J: Repeat ">" 2n times, merge and duplicate it N-\v*₴ Repeat "v" i minus n times and print it (without a newline) The satisfaction when I got it down from 79 bytes to 54 bytes was immense. This is code-golf so the shortest code in bytes wins. You can choose between uppercase or lowercase V but it has to be consistent. Vvvv> //add two more '>' than the row beneath Vvvv> //add two more '>' than the row above Vvvv> //fill to the row above and add N*1.5 times >
![also try vvvvvv also try vvvvvv](https://v-phinf.pstatic.net/20200726_93/1595770396566qdayi_JPEG/757e79b6-cf44-11ea-8f1e-246e963a464c_03.jpg)
Note that it gives a total of N/2 + 1 rows with the width N/2įirst part: vvvvvvvv //begin with width N Then you add N/2 rows with the width N/2 beneath to finish the downward knits. You subtract one v per row from the right side until you have N/2 as width.
#Also try vvvvvv full
Let me explain the full structure with an example for N=8: vvvvvvvv Structureīecause we will only use plain stitches you will only use v for a downward stitch and > for a stitch to the right. The input is an even integer N in the range. Long story short: a few days ago I accidentally started knitting a sock and the pretty logical structure of the plain stitches lead me to the idea: Why don't we just ASCII-knit a sock? Input