Generate a "Poem"

Question

Given a strictly positive integer, N, produce an output satisfying the following:

Produce an array of length N.
Every string (i.e. "word") in the array is of length N.
Every letter in the word is unique.
Every first letter of the words are unique between each other.
The remaining items of each word are equal to each other.

Example output

For an input of e.g. 3:

cba
dba
eba

Specification

Trailing whitespace is totally allowed.
The "letters" don't have to be from the lowercase alphabet, as long as they aren't whitespace.
The maximum N you need to support is 13, since there are 26 letters in the lowercase alphabet.
The separator of your array can be anything, as long as you will never involve that character for every possible input from 1 to 13. You can also just output a literal array.
Letters have to be 1 character long.
Letters are case-sensitive, e.g. a and A can appear on the same line.

Are upper and lower case letters considered to be different, so? e.g., can a and A appear on the same line? — Shaggy, Commented May 18, 2020 at 22:54

math junkie · Accepted Answer · 2020-05-17 15:12:45Z

7

Pyth, 9 bytes

V>QG+N<Gt

Try it online!

V>QG For each letter in the last Q (the input) elements of the lowercase alphabet:
+N>Gt Append that letter to the first Q-1 elements of the lowercase alphabet

For Q=13, the output looks like this:

nabcdefghijkl
oabcdefghijkl
pabcdefghijkl
qabcdefghijkl
rabcdefghijkl
sabcdefghijkl
tabcdefghijkl
uabcdefghijkl
vabcdefghijkl
wabcdefghijkl
xabcdefghijkl
yabcdefghijkl
zabcdefghijkl

answered May 17, 2020 at 15:12

math junkie

7,2471 gold badge22 silver badges46 bronze badges

1

\$\begingroup\$ The meaning behind this poem... so deep. \$\endgroup\$
– ihavenoidea
Commented May 19, 2020 at 5:24

Add a comment |

Neil · Accepted Answer · 2020-05-17 15:10:27Z

5

Charcoal, 11 bytes

ＮθＵＯθ⮌β↓…βθ

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

Ｎθ

Input N.

ＵＯθ⮌β

Print a square of size N filled with the reversed lowercase alphabet.

↓…βθ

Print the first N lowercase letters downwards.

answered May 17, 2020 at 15:10

Neil

174k12 gold badges73 silver badges277 bronze badges

Add a comment |

dingledooper · Accepted Answer · 2020-05-17 19:03:39Z

5

C (gcc), 58 bytes

i,j;f(n){for(i=n;i;)putchar(j++?j>n?j=!i--,10:j+63:i+77);}

Try it online!

answered May 17, 2020 at 19:03

dingledooper

22.8k1 gold badge35 silver badges125 bronze badges

Add a comment |

Surculose Sputum · Accepted Answer · 2020-05-17 19:30:42Z

Python 2, 53 bytes

lambda n:['%xopqrstuvwxyz'[:n+1]%i for i in range(n)]

Try it online!

Chooses a hex digit (0123456789abc) for the first character, and the last half of the alphabet for the rest.

Another 53-byter that does the same thing, using map:

lambda n:map('%xopqrstuvwxyz'[:n+1].__mod__,range(n))

Try it online!

Another 53-byter, this time using Python 3 f-string:

lambda n:[f'{i:x}copqrstuvwxyz'[:n]for i in range(n)]

Try it online!

If numeric characters are not allowed:

Python 2, 58 57 bytes

-1 byte thanks to @dingledooper !

lambda n:['%copqrstuvwxyz'[:n+1]%(i+65)for i in range(n)]

Try it online!

Choose the first letter from the first half of the alphabet, and the last letters from the last half of the alphabet.

lyxal · Accepted Answer · 2020-05-18 22:53:50Z

4

05AB1E, 10 8 bytes

AÂSìδ£I£

Try it online!

Haha! With the expert help of Kevin, I beat Pyth once again!

Explained (with Docs Descriptions)

A| 'abcdefghijklmnopqrstuvwxyz'
Â| Bifurcated a. Push a, reversed(a)
S| Cast a to a list of characters / digits.
ì| Merge b with a if both are lists, else prepend b to a. Push a.prepend(b)
δ| Outer Product. Get the next command and apply it double-vectorized.
£| Head. Push a[0:b]
I| Input
£| Head. Push a[0:b]

edited May 18, 2020 at 22:53

answered May 18, 2020 at 7:40

lyxal

34k2 gold badges63 silver badges139 bronze badges

\$\begingroup\$ Your outputs are 1 character too long. The I should be I<. I do have the feeling 8 should be possible though, so I'll see if I can find something. \$\endgroup\$
– Kevin Cruijssen
Commented May 18, 2020 at 10:14
1

\$\begingroup\$ Yay, found an 8-byter after all: AÂSìδ£I£ \$\endgroup\$
– Kevin Cruijssen
Commented May 18, 2020 at 11:56

Add a comment |

l4m2 · Accepted Answer · 2020-05-17 16:14:19Z

3

JavaScript (Node.js), 74 bytes

n=>(q=`opqrstuvwxyz,`.slice(13-n)).replace(/./g,t=>i.toString(++i)+q,i=10)

Try it online!

answered May 17, 2020 at 16:14

l4m2

26.1k2 gold badges23 silver badges97 bronze badges

\$\begingroup\$ As you don't use any stuff from Node libraries, consider changing it from JavaScript (Node.js) to JavaScript (ES6). \$\endgroup\$
– Petr Fiedler
Commented Oct 17, 2020 at 12:40

Add a comment |

Olivier Grégoire · Accepted Answer · 2020-05-18 13:19:35Z

3

Java (JDK), 83 bytes

n->{for(int i=n,j=0;i>0;)System.out.printf("%c",j++>0?j>n?10+(j=--i-i):j+63:i+77);}

Try it online!

I was able to make a one-liner, but it's 100 bytes long and works only on Java 13+ if that can inspire anyone to golf further...

n->(" %sNOPQRSTUVWXY".substring(0,n+2)).repeat(n).formatted((Object[])"ABCDEFGHIJKLM".split("",n+1))

Try it online!

edited May 18, 2020 at 13:19

answered May 18, 2020 at 8:53

Olivier Grégoire

14.4k3 gold badges32 silver badges56 bronze badges

Add a comment |

Mitchell Spector · Accepted Answer · 2020-05-19 06:01:34Z

dc, 52 bytes

[nAP1-d0<M]sL?dsnCo[d96+POO^OO^Bd*/-ODln-^/d0<L]dsMx

Try it online!

Input is on stdin, and output is on stdout.

Output for 13:

mBA9876543210
lBA9876543210
kBA9876543210
jBA9876543210
iBA9876543210
hBA9876543210
gBA9876543210
fBA9876543210
eBA9876543210
dBA9876543210
cBA9876543210
bBA9876543210
aBA9876543210

How it works:

[                     Start a macro.
 n                       Pop a number and print it.
 AP                      Print a newline.
 1-                      Decrement top of stack by 1.
 d0<                     If top of stack > 0,
 M                         then continue by calling macro M.
]sL                   End macro and save it in register L.

?                     Input number and push it on stack.
dsn                   Store top of stack in n.
Co                    Change output radix to base 12.

[                     Start a macro.
 d96+P                   Print the character with
                           ASCII code 96 + (top of stack).
                           (This will be a lower-case letter,
                           since 97 = 'a'.)
 OO^OO^Bd*/-ODln-^/      Push (12^12 - (12^12)/(11*11)) / (12^(13-n)).
                           In base 12, this is the leftmost n-1 digits
                           of BA9876543210 (or 0 for n=1).
 d0<L                    If this number > 0, call macro L to print it,
                           decrement the value of n at the top of stack,
                           and go back to the top of the loop M.
]dsMx                   End macro, save it in register M, and execute it.

lolad · Accepted Answer · 2020-05-19 08:58:46Z

3

Retina, 38 26 bytes

.+
*.
Y`.`l
L$`.
$=
Y`a`Rl

-12 bytes thanks to @Neil

Try it online!

This works by generating the beginning of 'abc...' length N, then repeating it and substituting the first letter for something from 'zyx...'

.+         This converts the number into unary, using dots
*.         ^
Y`.`l      A cyclic transliteration: replace all dots with something from a-m
L$`.       Repeat per N with a line break at the end
$=         ^
Y`a`Rl     Finally, transliterate each 'a' with something from z-n

edited May 19, 2020 at 8:58

answered May 17, 2020 at 17:04

lolad

8427 silver badges17 bronze badges

\$\begingroup\$ Oh, an actual use for the Y stage! An obvious saving is that all the lines will start with a, so there's no need to replace it with #, just transliterate the as directly. Then you can save a bit more by using the L$ stage to repeat rows by matching . and specifying a substitution of $=. (If not for that, the closing ) would have been unnecessary.) \$\endgroup\$
– Neil
Commented May 18, 2020 at 19:35
\$\begingroup\$ Thanks! I don't know how I didn't realise the a thing, and I thought there must be a better way to repeat a line \$\endgroup\$
– lolad
Commented May 19, 2020 at 8:49

Add a comment |

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

2

Japt, 9 8 bytes

;ÆîEhCgX

Try it

;ÆîEhCgX     :Implicit input of integer U
 Æ           :Map each X in the range [0,U)
  î          :  Slice to length U
;  E         :    Printable ASCII
    h        :    Replace first character (space) with
;    C       :      Lowercase alphabet
      gX     :      Character at index X

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered May 17, 2020 at 19:11

Shaggy

42.8k4 gold badges36 silver badges94 bronze badges

Add a comment |

Kamila Szewczyk · Accepted Answer · 2020-05-17 15:24:08Z

B (asm2bf dialect), 136 bytes

p(c){asm("rclr1,r4");asm("outr1");}g(){asm("in r1");}n;c 65;d;i;main(){i=n=g();while(i--){p(c++);d=65+n;while(d-n-65<n-1)p(d++);p(10);}}

Output assembly:

#!/usr/bin/env bfmake
    stk 16
    org 0
db_ 0
db_ 65
db_ 0
db_ 0
#PAGE_SIZE = 16
#MM_BASE = 5
#call("alloc")
    mov r4, r6
#call("_main")
    end
@alloc
#alloc("r6", "r5")
    ret
@_p
    rclr1,r4
    outr1
    ret
@_g
    in r1
    ret
@_main
    psh 3
    psh 0
#call("_g")
    mov r2, r1
    pop r1
    sto r1, r2
    pop r1
    sto r1, r2
@L1
    mov r2, 3
    rcl r1, r2
    dec r1
    sto r2, r1
    inc r1
    jz_ r1, %L2
    psh r4
#call("alloc")
    mov r2, 1
    rcl r1, r2
    inc r1
    sto r2, r1
    dec r1
    sto r6, r1
    mov r4, r6
#call("_p")
#free("r4")
    pop r4
    psh 2
    psh 65
    rcl r1, 0
    mov r2, r1
    pop r1
    add r1, r2
    mov r2, r1
    pop r1
    sto r1, r2
@L3
    rcl r1, 2
    psh r1
    rcl r1, 0
    mov r2, r1
    pop r1
    sub r1, r2
    mov r2, 65
    sub r1, r2
    psh r1
    rcl r1, 0
    mov r2, 1
    sub r1, r2
    mov r2, r1
    pop r1
    lt_ r1, r2
    jz_ r1, %L4
    psh r4
#call("alloc")
    mov r2, 2
    rcl r1, r2
    inc r1
    sto r2, r1
    dec r1
    sto r6, r1
    mov r4, r6
#call("_p")
#free("r4")
    pop r4
    jmp %L3
@L4
    psh r4
#call("alloc")
    sto r6, 10
    mov r4, r6
#call("_p")
#free("r4")
    pop r4
    jmp %L1
@L2
    ret

Kirill L. · Accepted Answer · 2020-05-17 17:24:38Z

2

Ruby, 47 bytes

->n{a=*?`..?z;(1..n).map{|i|a[i]+a[14,n-1]*''}}

Try it online!

answered May 17, 2020 at 17:24

Kirill L.

14.1k2 gold badges16 silver badges50 bronze badges

Add a comment |

Xcali · Accepted Answer · 2020-05-18 03:47:46Z

2

Perl 5 `-na`, 42 bytes

say$_,(A..Z)[0..$F[0]-2]for(N..Z)[0..$_-1]

Try it online!

answered May 18, 2020 at 3:47

Xcali

15.8k2 gold badges15 silver badges39 bronze badges

\$\begingroup\$ Nice! Had basically the same! :) You can save a few bytes using "@F" instead of $F[0] and reorganising the letters a bit (to avoid arithmetic): Try it online! \$\endgroup\$
– Dom Hastings
Commented May 18, 2020 at 11:29

Add a comment |

Mitchell Spector · Accepted Answer · 2020-05-18 09:22:15Z

2

Bash + Unix utilities, 62 59 bytes

dc -e'[nAP1-d0<M]sL?dsnCo[d96+POO^OO^Bd*/-ODln-^/d0<L]dsMx'

Try it online!

Input is on stdin, and output is on stdout.

Here's the original, longer answer:

echo {a..m}`echo {o..z}|tr -d \ `|fold -14|cut -b 1-$1|sed $1q

Try it online (62 bytes)

Input is passed as an argument, and output is on stdout.

edited May 18, 2020 at 9:22

answered May 17, 2020 at 18:26

Mitchell Spector

7,9531 gold badge16 silver badges35 bronze badges

Add a comment |

ghosts_in_the_code · Accepted Answer · 2020-05-19 08:35:46Z

2

Befunge-93, 53 51 bytes

&:v
< <>::      v:::\,+*77:
|  ^-1,+*88<_$$\1-0.:
@

Try it online!

0 is my two character delimiter. Outer loop outputs N'+(7*7) in ascii, sets M to N (this requires a swap) then enters inner loop. Inner loop outputs M+(8*8) in ascii and decrements M. On exiting inner loop outputs 0 and decrements N' (this requires a swap). | and _ are the loop condition instructions respectively. : is often used to make copies since most operations - from arithmetic to conditional check, destroy the value they operate on by popping it out of the stack

Befunge is stack based with a single instruction pointer that points to a character in the code. It has a travelling direction that can be changed via arrows <>^v

Befunge-98 submission by ovs, 43 bytes

&:>:77*+,\:>:: v
.:|;-1,+*8;^;8<_$$\1-0
  @

Try it online!

edited May 19, 2020 at 8:35

answered May 18, 2020 at 8:51

ghosts_in_the_code

3,3112 gold badges21 silver badges42 bronze badges

\$\begingroup\$ There's wasteful spaces that a better golfer could probably get rid of \$\endgroup\$
– ghosts_in_the_code
Commented May 18, 2020 at 9:27
\$\begingroup\$ 43 bytes by removing most of the spaces from the 53 byte version: tio.run/##S0pNK81LT9W1tPj/… \$\endgroup\$
– ovs
Commented May 19, 2020 at 8:00
\$\begingroup\$ You can use ' to push integers like 64 and 49 with just two bytes. \$\endgroup\$
– ovs
Commented May 19, 2020 at 8:04
\$\begingroup\$ @ovs Oh, I was looking at the specification on wikipedia which was for Befunge-93 (when writing my answer), didn't notice the difference. Should I edit your answer in or change mine to 93? Also I didn't understand what ' does in befunge-98 \$\endgroup\$
– ghosts_in_the_code
Commented May 19, 2020 at 8:23
1

\$\begingroup\$ ' pushes the character value of the next cell on the stack. An example: '@ pushes 64 on the stack. (A complete funge-98 specification can be found at quadium.net/funge/spec98.html) \$\endgroup\$
– ovs
Commented May 19, 2020 at 8:33

| Show 3 more comments

LegionMammal978 · Accepted Answer · 2020-10-31 00:19:04Z

2

Husk, 14 12 11 bytes

←ẊM:M↑½…"az

Try it online! Splits the alphabet into two halves, truncates each half to the size of the input, and then recombines them in the proper way.

edited Oct 31, 2020 at 0:19

answered Oct 15, 2020 at 11:22

LegionMammal978

18k4 gold badges24 silver badges57 bronze badges

Add a comment |

Kamila Szewczyk · Accepted Answer · 2020-05-17 15:36:24Z

1

C (gcc), 98 88 bytes

-10 thanks to @ceilingcat

c,d,i,j;f(n){for(c=65,i=n,d=c+n;i--;puts(""))for(j=!putchar(c++);j<n-1;)putchar(d+j++);}

Try it online!

edited May 17, 2020 at 15:36

answered May 17, 2020 at 14:48

Kamila Szewczyk

12.6k1 gold badge30 silver badges61 bronze badges

1

\$\begingroup\$ 86 bytes by removing the (as far as I think they are called in this terrible version of C) forward declarations of c,d,i: Try it online! (I'm also not sure why you are compiling with -Dp=putchar) \$\endgroup\$
– the default.
Commented May 17, 2020 at 15:39
\$\begingroup\$ it's a leftover; I probably forgot to remove it \$\endgroup\$
– Kamila Szewczyk
Commented May 17, 2020 at 15:46
\$\begingroup\$ Why not d=78? \$\endgroup\$
– l4m2
Commented May 17, 2020 at 16:17
1

\$\begingroup\$ Suggest ~j+n instead of j<n-1 \$\endgroup\$
– ceilingcat
Commented May 17, 2020 at 16:18
\$\begingroup\$ 73 bytes (I changed almost everything though, not sure whether I should post this as my own answer): Try it online! \$\endgroup\$
– the default.
Commented May 17, 2020 at 16:30

| Show 1 more comment

Jonathan Allan · Accepted Answer · 2020-05-17 16:23:55Z

1

Jelly, 9 bytes

Øa;€Ṛ$ḣḣ€

A monadic Link accepting an integer in \$[1,13]\$ which yields a list of lists of characters.

Try it online!

How?

Øa;€Ṛ$ḣḣ€ - Link: integer, N
Øa        - lower-case alphabet
     $    - last two links as a monad:
    Ṛ     -   reverse (the alphabet)
  ;€      -   concatenate that to each of (the alphabet)
      ḣ   - head to index (N)
       ḣ€ - head each to index (N)

answered May 17, 2020 at 16:23

Jonathan Allan

109k7 gold badges64 silver badges280 bronze badges

Add a comment |

Arnauld · Accepted Answer · 2020-05-17 17:36:01Z

1

JavaScript (Node.js), 66 60 bytes

f=(n,k=n*n)=>k?Buffer(k--%n?[97+k%n]:[10,123-k/n])+f(n,k):''

Try it online!

edited May 17, 2020 at 17:36

answered May 17, 2020 at 17:25

Arnauld

195k20 gold badges179 silver badges644 bronze badges

Add a comment |

Engineer Toast · Accepted Answer · 2020-05-19 19:38:38Z

Google Sheets, 76 bytes

=ArrayFormula(Char(Row(Offset(78:78,,,A1)))&Join(,Char(Row(Offset(65:65,,,A1

When you exit the cell, Sheets will automatically add the 5 trailing parentheses. Input is in cell A1. Output is wherever you put the formula and the N-1 cells below it.

Row(Offset(78:78,,,A1)) gives us an array from 78 to 78+N-1.
Char(Row(~)) turns that array into their ASCII equivalent (capital letters).
Char(Row(Offset(65:65,,,A1))) does the same thing for the range 65 to 65+N-1.
Join(Char(~)) combines that second array into a single string.
ArrayFormula(~) makes these functions input and output arrays instead of a single value.

Variax · Accepted Answer · 2020-05-21 17:00:53Z

1

[MATLAB/Octave], 35 bytes

char([N+[1:N]',ones(N,1)*[1:N]]+64)

First create a column vector ranging from N+1 to 2N with N+[1:N]. Make a column vector with all values equal to one and length N, and multiply by a row vector containing values 1 to N to make a matrix of N columns with all rows equal to 1:N. Concatenate the first vector with your matrix, add 64 to all digits and use char to turn every row into a string.

answered May 21, 2020 at 17:00

Variax

1512 bronze badges

Add a comment |

lynn · Accepted Answer · 2020-10-17 22:04:55Z

1

Haskell, 34 bytes

(\t->t.(:['n'..])<$>t['a'..]).take

Try it online!

answered Oct 17, 2020 at 22:04

lynn

69k11 gold badges133 silver badges282 bronze badges

Add a comment |

JosiahRyanW · Accepted Answer · 2020-10-17 19:36:44Z

0

CJam, 22 bytes

'[,65>_W%qi<_,(@<am*N*

Try it online!

This works by generating the Cartesian product of the each of the last n characters of the alphabet and a singular array containing a string with the first n-1 characters of the alphabet. For example, the following is outputted for 13:

ZABCDEFGHIJKL
YABCDEFGHIJKL
XABCDEFGHIJKL
WABCDEFGHIJKL
VABCDEFGHIJKL
UABCDEFGHIJKL
TABCDEFGHIJKL
SABCDEFGHIJKL
RABCDEFGHIJKL
QABCDEFGHIJKL
PABCDEFGHIJKL
OABCDEFGHIJKL
NABCDEFGHIJKL

answered Oct 17, 2020 at 19:36

JosiahRyanW

4,2211 gold badge17 silver badges18 bronze badges

Add a comment |

JosiahRyanW · Accepted Answer · 2020-10-17 20:54:29Z

Poetic, 360 bytes

absently,i jot out words,A-Z
moving a pen mindlessly about a page
i am making my art,i`m doing a poem
i ensure i can never do patterns at first
i`d alter a chr i am using
i`d say i am not consistent,cause i`m using a perfect copy i forged when i end a certain verse
o yes,i reckon i am doing A-Z lazily
o yes,i admit
o yes,i am silly
i compose tripe,o yes i do

Try it online!

This works by filling the entire memory with the negative of the inputted number (as that's the shortest way to copy it to multiple cells), then outputting the first character - which is decremented each iteration - and then the last few ASCII characters up to ASCII 255.

Warning: this takes a long time to run, even for small inputs. Such is the price to pay for a short length.

Stack Exchange Network

Generate a "Poem"

Example output

Specification

24 Answers 24

Pyth, 9 bytes

Charcoal, 11 bytes

C (gcc), 58 bytes

Python 2, 53 bytes

Python 2, 58 57 bytes

05AB1E, 10 8 bytes

Explained (with Docs Descriptions)

JavaScript (Node.js), 74 bytes

Java (JDK), 83 bytes

dc, 52 bytes

Retina, 38 26 bytes

Japt, 9 8 bytes

B (asm2bf dialect), 136 bytes

Ruby, 47 bytes

Perl 5 `-na`, 42 bytes

Bash + Unix utilities, 62 59 bytes

Befunge-93, 53 51 bytes

Husk, 14 12 11 bytes

C (gcc), 98 88 bytes

Jelly, 9 bytes

How?

JavaScript (Node.js), 66 60 bytes

Google Sheets, 76 bytes

[MATLAB/Octave], 35 bytes

Haskell, 34 bytes

CJam, 22 bytes

Poetic, 360 bytes

Your Answer

Hot Network Questions

Generate a "Poem"

Example output

Specification

24 Answers 24

Pyth, 9 bytes

Charcoal, 11 bytes

C (gcc), 58 bytes

Python 2, 53 bytes

Python 2, 58 57 bytes

05AB1E, 10 8 bytes

Explained (with Docs Descriptions)

JavaScript (Node.js), 74 bytes

Java (JDK), 83 bytes

dc, 52 bytes

Retina, 38 26 bytes

Japt, 9 8 bytes

B (asm2bf dialect), 136 bytes

Ruby, 47 bytes

Perl 5 -na, 42 bytes

Bash + Unix utilities, 62 59 bytes

Befunge-93, 53 51 bytes

Husk, 14 12 11 bytes

C (gcc), 98 88 bytes

Jelly, 9 bytes

How?

JavaScript (Node.js), 66 60 bytes

Google Sheets, 76 bytes

[MATLAB/Octave], 35 bytes

Haskell, 34 bytes

CJam, 22 bytes

Poetic, 360 bytes

Your Answer

Sign up or log in

Post as a guest

Related

Hot Network Questions

Perl 5 `-na`, 42 bytes