A very long Terza Rima

Question

Description

Output the rhyme scheme for a very long Terza Rima.

Input

None.

Output

ABA
BCB
CDC
DED
EFE
FGF
GHG
HIH
IJI
JKJ
KLK
LML
MNM
NON
OPO
PQP
QRQ
RSR
STS
TUT
UVU
VWV
WXW
XYX
YZY

Rules

You can pick between separating stanzas with whitespace or newlines, so either:

ABA BCB...

OR

ABA
BCB
...

A single trailing whitespace allowed per line and one trailing newline allowed.

Output can be either uppercase or lowercase.

This is code-golf, so the shortest code in bytes for each language wins.

Answer 1

JavaScript (ES6), 51 50 49 bytes

Saved 1 byte thanks to @l4m2

f=(n=45358)=>n%63?f(n-1333)+n.toString(36)+' ':''

Try it online!

How?

We start with n = 45358 (yzy in base-36). We subtract 1333 from n at each iteration (111 in base-36). We stop as soon as n MOD 63 = 0, because 12033 (9a9 in base-36) is the first value for which this condition is fulfilled, and 63 is the smallest modulo with such a property.

Decimal | Base-36 | MOD 63
--------+---------+-------
  45358 |   yzy   |   61
  44025 |   xyx   |   51
  42692 |   wxw   |   41
  41359 |   vwv   |   31
  40026 |   uvu   |   21
  38693 |   tut   |   11
  37360 |   sts   |    1
  36027 |   rsr   |   54
  34694 |   qrq   |   44
  33361 |   pqp   |   34
  32028 |   opo   |   24
  30695 |   non   |   14
  29362 |   mnm   |    4
  28029 |   lml   |   57
  26696 |   klk   |   47
  25363 |   jkj   |   37
  24030 |   iji   |   27
  22697 |   hih   |   17
  21364 |   ghg   |    7
  20031 |   fgf   |   60
  18698 |   efe   |   50
  17365 |   ded   |   40
  16032 |   cdc   |   30
  14699 |   bcb   |   20
  13366 |   aba   |   10
  12033 |   9a9   |    0

Answer 2

C (gcc), 41 bytes

f(i){for(i='ABA';i%29;i+=65793)puts(&i);}

Try it online!

Fixed and -9 thanks to user202729. -1 thanks to Dennis and -2 thanks to Arnauld too.

Answer 3

Jelly, 7 bytes

ØAṡ2ŒBY

Try it online!

-1 byte thanks to Dennis

ØAṡ2ŒBY  Main Link
ØA       Alphabet
  ṡ2     Slice into overlapping slices of length 2
    ŒB   Palindromize (bounce) each
      Y  Join by newlines

Answer 4

05AB1E, 5 bytes

Aü«€û

Try it online!

-1 byte thanks to Emigna
-1 byte thanks to rule change; thanks to kalsowerus for pointing that out

^{_{Hehe, currently beats Pyth. \o/}}

Explanation

Aü«€û»  Full Program
A       Lowercase Alphabet
 ü«     Pairwise with merge-list
   €û   For each, palindromize

Answer 5

brainfuck, 51 48 bytes

Saved 3 bytes thanks to @ovs.

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

Try it online!

Explanation

INITIALIZE TAPE:

0000:           (none)
0001: C_NEWLINE (10)
0002: V_COUNT   (25)
0003: V_ALPHA   (64)
++++++++[>+>+++>++++++++<<<-]>++>+

V_COUNT TIMES:              [-
    INCREMENT V_ALPHA         >+
    PRINT V_ALPHA             .
    PRINT V_ALPHA PLUS ONE    +.
    PRINT V_ALPHA             -.
    PRINT C_NEWLINE           <<.
END LOOP                    >]

Answer 6

brainfuck, 51 49 bytes

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

Try it online!

An attempt at an explanation...

+++++                     #Put 5 in cell 0 because that is the highest common denominator of 10, 65 and 25
[                         #Start loop
>+++++                    #Counter in cell 1 is 25 (How many lines we must print)
>+++++++++++++            #Counter in cell 2 is 65 (ASCII A)  
>++                       #Counter in cell 3 is 10 (Newline)
<<<-]                     #Decrement the outer counter until the cells have the right values (muliples of 5).
>                         #Move to the counter that says how many lines we must print.
[>.                       #Print the character in cell 2
+.                        #Add one to the character in cell 2 and print it
-.                        #Subtract one from the character in cell 2 and print it
+                         #Add one to the character in cell 2 for the next loop
>.                        #Print a new line
<<-]                      #Decrement cell 1 and run again until cell 1 is 0

-2 with thanks to @ovs

My first attempt at brainfuck so any hints gratefully received. If I was more experienced with it then I am sure I could shave a few more bytes off but I only got into it yesterday.

Answer 7

APL (Dyalog), 14 bytes

25↑0 1 0⊖3/⍪⎕A

Try it online!

Please note that the added ⎕← is for TIO to output the text and is not normally required.

Answer 8

Python 2, 42 41 bytes

^{-1 byte thanks to Halvard Hummel}

i=65;exec"print'%c'*3%(i,i+1,i);i+=1;"*25

Try it online!

Answer 9

Charcoal, 11 bytes

Ｅ²⁵✂αι⁺²ι‖Ｏ

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

 ²⁵         Literal 25
Ｅ           Map over implicit range
    α       Predefined uppercase letters
   ✂ ι⁺²ι   Slice 2 characters
            Implicitly print result on separate lines
         ‖Ｏ Reflect with overlap

Answer 10

Brain-Flak, 90 bytes

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

Try it online!

One reason this is shorter than the other brain-flak answer is because it uses uppercase instead of lowercase characters, which have smaller ASCII values, and are therefore easier to push.

Explanation:

#Push 25
((((()()()){}){}){}())

#While true
{

    #Keep track of the number on top of the stack...
    # We'll call it 'a'
    (({})

        #Push A +...
        <((({}

        # 64 (push)
        ((((()()()()){}){}){}){})
        # + 1 (push)
        ())
        # - 1 (push)
        [()])

        # Push 10
        ((()()()()()){})>

    # Now that's all pushed, we push a - 1 to decrement the loop counter
    [()])

# Endwhile
}

Answer 11

><>, 25 24 23 22 bytes

Saved 2 bytes thanks to Jo King

"!;::o1+:o$oao:'Y')0.A

Try it online!

Answer 12

R, 51 47 bytes

L=LETTERS;cat(sprintf("%s%s%1$s",L[-26],L[-1]))

Output:

> L=LETTERS;cat(sprintf("%s%s%1$s",L[-26],L[-1]))
ABA BCB CDC DED EFE FGF GHG HIH IJI JKJ KLK LML MNM NON OPO PQP QRQ RSR STS TUT UVU VWV WXW XYX YZY

Answer 13

Befunge-98 (FBBI), 27 23 21 bytes

-4 bytes thanks to James Holderness

j'@1+3k:,1+,,a,'Y/!1+

Try it online!

Answer 14

Java 8, 132 85 62 60 Bytes

• 47 bytes thanks to Neil
• 26 bytes thanks to Oliver
• 3 bytes and much better formatting thanks to Kevin
• Error fixed by Oliver

Golfed

a->{for(char i=64;++i<90;)System.out.println(""+i+++i--+i);}

Ungolfed

public class TerzaRima {
    interface A{
        void a(String a);
    }
    static A a = a -> {
        for (char i = 64; ++i < 90; ) System.out.println("" + i++ + i-- + i);
    };
    public static void main(String[] args){
        a.a(null);
    }
}

Answer 15

Husk, 9 bytes

ẊS:`e…"AZ

Try it online!

Answer 16

brainfuck, 41 bytes

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

Try it online!

Answer 17

brainfuck, 45 37 bytes

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

Try it online!

Prints in uppercase, separated by spaces with a trailing space.

How it Works:

+[[<+>>++<-]>] Intialises the tape with the format n^2
               1 2 4 8 16 32 64 128 0 0'
<<---          Navigates to the desired section and tweaks the counter
               1 2 4 8 16 32 64 125<
[-----<+.+.-.<.>>] Prints the Terza Rima, using:
                 125 as the loop counter (decremented by 5 each loop)
                 64 as the current alphabetic character (incremented and printed each loop)
                 32 as the space character

Answer 18

Pyth, 7 bytes

jC[GtGG

Try it here!

_{Hehe, currently beats Jelly. \o/}

Easily translates to the follwong 05ab1e program:

05AB1E, 7 bytes

AA¦A)ø»

Try it online!

Answer 19

Haskell, 28 bytes

[[x,succ x,x]|x<-['A'..'Y']]

Try it online!

succ is such an unfortunate naming choice...

Explanation

[[x,succ x,x]|x<-['A'..'Y']]

[            |x<-          ]  -- for x in...
                 ['A'..'Y']   -- the alphabet sans Z
 [x,succ x,x]                 -- construct a string of x, the successor of x and x

Answer 20

J, 15 bytes

u:2$~&3\65+i.26

Try it online!

Answer 21

PowerShell, 39 37 bytes

65..89|%{-join[char[]]($_,++$_,--$_)}

Try it online!

Loops from 65 to 89. Each iteration, we're constructing an integer array of (the current, one more, and the current) of the current digit, using pre-increment and pre-decrement. That's then re-cast as a char-array, and -joined together into a single string. Each string is left on the pipeline and an implicit Write-Output at program completion gives us a newline between each element for free.

---

Alternatively, same byte count

65..89|%{-join[char[]]($_,($_+1),$_)}

Try it online!

Answer 22

Haskell, 34 32 31 bytes

Based on totallyhuman's answer. -1 byte thanks to H.PWiz

do x<-['A'..'Y'];x:succ x:x:" "

Try it online!

Answer 23

Brain-Flak, 180 bytes

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

Try it online!

Thanks to DJ for getting this working

Answer 24

R, 40 36 bytes

cat(paste0(L<-LETTERS,L[-1],L)[-26])

Try it online!

An alternative to plannapus' answer; this turns out to be a bit golfier; I've posted it per his request.

See also this 40 byte answer by NofP which is quite nice.

Answer 25

R, 40 bytes

cat(intToUtf8(rbind(x<-65:89,x+1,x,10)))

Try it online!

One more alternative in R to Plannapus and Giuseppe's answers. Posted following their request. This solution uses ASCII code to UTF8 coding.

PS if TABs were allowed, one could replace the newline (ASCII code 10) with a tabulation (ASCII code 9), and the solution could shrink to 39 bytes:

cat(intToUtf8(rbind(x<-65:89,x+1,x,9)))

Answer 26

Pepe, 59 56 bytes

^{-3 bytes thanks to u_ndefined}

REeEeEEeEerEeEeeeeeERrEEEEErEEEeeREEreeerEEEEEeeEreeERee

Try it online!

Explanation:

# Prepare stacks

  # prepare stack R [Z]
  REeEeEEeEe  # push Z

  # prepare stack r [A,B,A]
  rEeEeeeeeE  # push A
  RrEEEEE     # copy and increment A (getting B)
  rEEEee      # duplicate A to end

# Start loop
REE           # create label Z

  reee        # output stack r contents
  rEEEEEeeE   # increment all

  reeE        # end line

Ree           # loop while r[p] != Z

Answer 27

J, 18 16 bytes

2(,{.)\u:65+i.26

Changed a.{~ to u: after Conor O'Brien's and FrownyFrog's solutions

Try it online!

Answer 28

Befunge, 26 bytes

:"A"+:,:1+,,1+:64*`#@_55+,

Try it online!

Answer 29

Retina, 24 bytes

ABA
;{:G`
T`_p`p`[^Y]..

Try it online!

Answer 30

Perl 5, 27 24 bytes

say$\=$_++,$_.$\for A..Y

previous solution

say$_,chr 1+ord,$_ for A..Y

Try it online

Answer 31

K (oK), 17 16 bytes

Solution:

`c$010b+/:65+!25

Try it online!

Explanation:

Might be a better way, but this is what I came up with:

`c$010b+/:65+!25 / the solution
             !25 / til 25 => 0..24
          65+    / add 65 -> 65..89 
       +/:       / add left to each right
   010b          / boolean array of 0 1 0
`c$              / cast to ASCII characters

Answer 32

MATL, 12 11 10 bytes

1 byte off thanks to Luis Mendo, by using 5B (5 in binary) to push a [1 0 1] pattern.

66:90!5B-c

Try it online!

Answer 33

brainfuck, 73 bytes

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

Try it online!

Answer 34

T-SQL 189 154 bytes

declare @ char(26)='ABCDEFGHIJKLMNOPQRSTUVWXYZ',@i int=1,@@ char while(@i<26)begin  set @@=substring(@,@i,1)print @@+substring(@,@i+1,1)+@@ set @i=@i+1 end

Answer 35

Recursiva, 13 bytes

{B25"PpZ~}(;}

Try it online!

Answer 36

J (repl), 18 bytes

u:65+(,>:,])"+i.25

Try it online!

Can be made into a function for +4 bytes:

(u:65+(,>:,])"+i.25)"_

Other solutions:

u:|:65 66 65+/i.25

Explanation

u:65+(,>:,])"+i.25
              i.25     range [0, 25)
     (     )"+         on each number:
      ,  ,               create a list composed of the number,
       >:                the number + 1
          ]              and the number
                       this gives the 2D list [0 1 0] [1 2 1] ...
  65+                  add 65 to each element
u:                     convert to characters

Answer 37

Batch, 99 bytes

@set s=ABCDEFGHIJKLMNOPQRSTUVWXYZ
:l
@echo %s:~0,2%%s:~0,1%
@set s=%s:~1%
@if not %s%==Z goto l

Only 10 bytes shorter than a literal...

Answer 38

Kotlin, 42 bytes

{('A'..'Y').map{println("$it${it+1}$it")}}

Try it online!

or

{('A'..'Y').map{println(""+it+(it+1)+it)}}

Try it online!

Answer 39

Add++, 46 44 bytes

L,"ABCDEFGHIJKLMNOPQRSTUVWXYZ"dBREpBR2DBcEJn

Try it online!

Who needs all these "palindromise" functions?

2 bytes saved thanks to DLosc!

How it works (old version)

L,     - Create a nilary lambda function.
  "…"  - Push the uppercase alphabet;     STACK = ['ABC…XYZ']
  d    - Duplicate;                       STACK = ['ABC…XYZ' 'ABC…XYZ']
  BR   - Reverse;                         STACK = ['ABC…XYZ' 'ZYX…CBA']
  2D   - Duplicate from below;            STACK = ['ABC…XYZ' 'ZYX…CBA' 'ABC…XYZ']
  Ep   - Dequeue each;                    STACK = ['BCD…XYZ' 'YXW…CBA' 'BCD…XYZ']
  $BR$ - Reverse the middle string;       STACK = ['BCD…XYZ' 'ABC…WXY' 'BCD…XYZ']
  Bc   - Zip;                             STACK = [['A' 'B' 'A'] … ['Y' 'Z' 'Y']]
  EJ   - Join each;                       STACK = ['ABA' … 'YZY']
  n    - Join with newlines               STACK = ['ABA…YZY']

Answer 40

Shnap, 35 bytes

for c:'A'..'Z'println(""+c+(c+1)+c)

Try it online!

Answer 41

Brain-Flak classic, 160 150 118+2=120 bytes with -A flag

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

Try it online!

The separator is a newline.

-8 bytes thanks to DJ

-32 bytes thanks to DJ

Answer 42

Japt, 11 6 bytes

Returns an array of lines.

;BäÈiZ

Try it

---

Explanation

• ;B is the uppercase alphabet.
• äÈ gets each pair of consecutive characters in a string and passes them through a function.
• iZ prepends the current element to the first character of the current element.

---

Alternative, 6 bytes

;Bã mê

Try it

---

Explanation

• ã splits the alphabet string into an array of consecutive character pairs.
• m maps over the array.
• ê palindromises the current element.

Answer 43

Pushy, 9 bytes

Z1Z25:QKh

Try it online!

Explanation:

Z1Z          \ Make the stack [0, 1, 0]
   25:       \ 25 times do:
      Q      \    Print the stack, as indexes into the uppercase alphabet
       Kh    \    Increment all values

Answer 44

Ruby, 32 bytes

puts (?A..?Y).map{|c|c+c.next+c}

Try it online!

---

If a list of strings is valid output:

Ruby, 31 bytes

->{(?A..?Y).map{|c|c+c.next+c}}

Try it online!

Answer 45

V, 16 bytes

¬azòóˆˆ/±²±\r²òd

Try it online!

Hexdump:

00000000: ac61 7af2 f388 882f b1b2 b15c 72b2 f264  .az..../...\r..d

Recursive Regular Expressions for the win!

Answer 46

Clean, 60 bytes

import StdEnv
t=foldr(+++)""[{c,c+one,c,' '}\\c<-['a'..'y']]

Try it online!

If a list of Char ([Char]) is okay instead of a String ({#Char}) (they look the same when printed bare), then we can save a few bytes and use:

Clean, 53 bytes

import StdEnv
t=flatlines[[c,c+one,c]\\c<-['a'..'y']]

Try it online!

If a list of String ([{#Char}]) representing the lines is acceptable, then we can save even more and use:

Clean, 45 bytes

import StdEnv
t=[{#c,c+one,c}\\c<-['a'..'y']]

Try it online!

Answer 47

Funky, 38 bytes

fori=65i<90i++print("%c%c%c"%{i i+1i})

Naïve solution, not very exciting, but it works.

Try it online!

Answer 48

dc, 24 bytes

65[ddP1+dPrPdAP90>M]dsMx

Try it online!

Pretty straightforward. Start with ASCII value for A, duplicate it a couple of times, print it, increment it and duplicate this, print it, swap the top-of-stack, print (the unincremented number), print a line feed, keep going as long as we haven't made it to Z (90).

Answer 49

Python 3, 55 bytes

' '.join(map(lambda x:"%c"*3%(x-1,x,x-1),range(66,91)))

Try it online!

Answer 50

PHP, 72 bytes

-2 bytes because yay assumed values!

-15 bytes thanks to Francisco Hahn

<?php $x=ABA;for($i=0;$i<75;$i++){if($i%3==0){echo$x." ";}$t=$x[$i%3];$x[$i%3]=++$t;}?>

Try it online!

Takes the string "ABA" through a for loop which loops through each character and increments it. Displays the current value of the string every 3 times.

Answer 51

Premier, 18 bytes

:| s |ns:'Z~*AUc
A

Try it online!

Explanation

The second line just defines the data for the program. So, starting wtih A on the stack...

:| s |ns:'Z~*AUc
:|   |n            print the following format:
  .                   TOS
   s                  TOS + 1
    .                 TOS
                   this prints out ABA, for example
       s:'Z~*      If the next char is not 'Z'
             A        append it to the data
              Uc   print a newline

This repeats until the next character is Z, at which point there is no data left, and the program terminates.

Answer 52

vim, 48 28 keystrokes

:h<_EnterjjYZZPqqy2llpi ESCl@qq@qD

My first attempt at golfing in vim

Explanation

:h<_EnterjjYZZP                    Insert the alphabet by copying it from the help manual
qq                                  Define a macro `q`:
 y2l                                 Copy the first two characters (relative to the cursor)
 lp                                  Paste after the copied characters (ABCDE -> ABABCDE)
 i Esc                             Insert a space (ABABCDE -> ABA BCDE)
 l@q                                 Run the macro again with the cursor after the space
q@q                                 End the macro defenition and run it
D                                   Remove the last Z

Answer 53

Go, 56 Bytes

func n(){for i:=65;i<90;i++{Printf("%c%c%c\n",i,i+1,i)}}

Ungolfed and readable:

func n() {
    for i := 65; i < 90; i++ {
        Printf("%c%c%c\n", i, i + 1, i)
    }
}

Try it online!

Answer 54

Go, 60 56 bytes

func t(){for i:=65;i<90;i++{Printf("%c%c%c\n",i,i+1,i)}}

Try it online!

Answer 55

GolfScript, 17 bytes

90,65>''+{.).(n}%

Try it online!

Explanation

90,65>            # Yield the uppercase alphabet
      ''+         # Convert to a string
         {     }% # For every codepoint in the string:
          .)      # Push the codepoint incremented
            .(    # Push the codepoint decremented
              n   # Push a newline

Answer 56

naz, 60 bytes

8a8m2x1v2d3m7s2x2v1x1f1v1a1o1a1o1s1o2x1v0m9a1a1o1v3x2v1l0x1f

Explanation (with 0x commands removed)

8a8m2x1v                               # Set variable 1 equal to 64 ("@")
2d3m7s2x2v                             # Set variable 2 equal to 89 ("Y")
1x1f                                   # Function 1
    1v                                 # Load variable 1 into the register
      1a1o1a1o1s1o                     # Output the next line of the rhyme scheme
                  2x1v                 # Store the value of the register in variable 1
                      0m9a1a1o         # Output a newline
                              1v       # Load variable 1 into the register
                                3x2v1l # Jump back to the start of the function
                                       # if the value in the register is less than variable 2
1f                                     # Call function 1

Answer 57

SOGL V0.12, 7 bytes

ZZ«Z⁰Ij

Try it Here!

Answer 58

Standard ML (MLton), 62 bytes

fun$90=""| $n=implode(map chr[n,n+1,n,32])^ $(n+1);print($65);

Try it online!

Ungolfed:

fun f 90 = ""
  | f  n = implode(map chr[n,n+1,n,32]) ^ f(n+1);

print(f 65);

Answer 59

SNOBOL4 (CSNOBOL4), 83 82 81 79 72 bytes

R	&UCASE POS(I) LEN(1) . L @I LEN(1) . R	:F(END)
	OUTPUT =L R L	:(R)
END

Try it online!

I think I'm finally getting the hang of @!

SNOBOL variables are initialized automatically to "" which is also equivalent to 0. So the first time the interpreter sees line R, the line is:

&UCASE POS(0) LEN(1) . L @I LEN(1) . R  :F(END)

which finds a LENgth 1 string starting at POSition 0 (the beginning of the string), assigning the matched string to L. Then we assign the position of that match to I using @, which has been incremented by 1 because of the LEN(1) . L. The next character is then matched and assign it to R, and output L R L. This continues until I is 25, since then LEN(1) . R fails to match, as L would be Z.

Answer 60

VBA, 40 Bytes

Anonymous VBE immediate window function that takes no input and outputs to the vbe immediate window.

For i=65To 89:a=Chr(i):?a;Chr(i+1)a:Next

Answer 61

Acc!!, 66 bytes

Count i while i-25 {
	i+65
	Write _
	Write _+1
	Write _
	Write 0
}

Try it online!

Answer 62

Cubically, 34 bytes

FRF'-2(+345@+33-5@-33+5@-33200@1)6

Try it online!

It was hard... At least it's doable. (without too much hardcoding)

Other Rubik's algorithm may lead to shorter sequence.

Some alternatives I tried (which is, unfortunately, longer):

35 bytes: Try it online!

36 bytes: Try it online!

---

Explanation:

FRF'      Rubik's cube algorithm. This algorithm has the property of make face
          value 1 equal to 10. (character of code of `\n`)
-2        Subtract face value 2 (which is 25) from the notepad.
(    )6   While notepad is nonzero:
+345        Add 90 to notepad.
@           Print notepad value.
+33-5       Add 1 to notepad.
@           Print notepad value.
-33+5       Subtract 1 from notepad.
@           Print notepad value.
-33200      Subtract 89 from notepad.
@1          Print face value 1 (which is 10, '\n')

Answer 63

ReRegex, 50 bytes

>Z//>(.)(.)/$1$2$1 >$2/>ABCDEFGHIJKLMNOPQRSTUVWXYZ

Outputs in the form

ABA BCB CDC...

Try it online!

Answer 64

uBASIC, 64 bytes

0ForI=65To89:A$=Left$(Chr$(I),1):?A$;Left$(Chr$(I+1),1);A$:NextI

Try it online!

Answer 65

MY-BASIC, 48 bytes

For I=65 To 89
A=Chr(I)
Print A+Chr(I+1)+A;
Next

Try it online!

Answer 66

Visual Basic .NET (Mono), 105 bytes

Module M
Sub Main
Dim I,S
For I=65 To 89
S=Chr(I)
Console.WriteLine(S+Chr(I+1)+S)
Next
End Sub
End Module

Try it online!

Answer 67

Yabasic, 45 bytes

For I=65To 89
?Chr$(I)+Chr$(I+1)+Chr$(I)
Next

Try it online!

Answer 68

Vim, 29 keypresses

:h<_<CR>jjY<C-^>PVUqqy2llpi<CR><Esc>q25@qdj

Answer 69

PHP, 79 Bytes

Try it online!

Code (recursive function)

function f($l=25){if($l>0){echo chr($l+65).chr($l+64).chr($l+65)."
".f($l-1);}}

Explanation

function f($l=25){         #Running the function 25 times                  
    if($l>0){               
        echo chr($l+65)    #start getting Z
            .chr($l+64)    # Y in the middle
            .chr($l+65)."  # with chr is still less bytes than str_pad
            ".f($l-1);     #call the function with $l-1
                           #in that call we get the line with YXY
                           #the result works because its writen in the
                           #inverted order of the stack :D
    }
}

Answer 70

Small Basic, 92 bytes

A Script that takes no input and outputs to the TextWindow Object

For I=65To 89
c=Text.GetCharacter(i)
TextWindow.WriteLine(c+Text.GetCharacter(i+1)+c)
EndFor

Try it at SmallBasic.com! Requires IE/Silverlight

Answer 71

K4, 15 bytes

Solution:

+-1 1 -1_\:.Q.A

Explanation:

Take A..Z, drop the last/first/last elements and then transpose:

+-1 1 -1_\:.Q.A / the solution
           .Q.A / "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
        _\:     / drop (_) each-left from the right argument
 -1 1 -1        / the list (-1;1;-1)
+               / flip

Answer 72

Python 3, 49 bytes

' '.join(['%c'*3%(x,x+1,x)for x in range(65,90)])

Try it online