Print an alphabet wave

Question

You are to print this exact text:

ABABABABABABABABABABABABAB
BCBCBCBCBCBCBCBCBCBCBCBCBC
CDCDCDCDCDCDCDCDCDCDCDCDCD
DEDEDEDEDEDEDEDEDEDEDEDEDE
EFEFEFEFEFEFEFEFEFEFEFEFEF
FGFGFGFGFGFGFGFGFGFGFGFGFG
GHGHGHGHGHGHGHGHGHGHGHGHGH
HIHIHIHIHIHIHIHIHIHIHIHIHI
IJIJIJIJIJIJIJIJIJIJIJIJIJ
JKJKJKJKJKJKJKJKJKJKJKJKJK
KLKLKLKLKLKLKLKLKLKLKLKLKL
LMLMLMLMLMLMLMLMLMLMLMLMLM
MNMNMNMNMNMNMNMNMNMNMNMNMN
NONONONONONONONONONONONONO
OPOPOPOPOPOPOPOPOPOPOPOPOP
PQPQPQPQPQPQPQPQPQPQPQPQPQ
QRQRQRQRQRQRQRQRQRQRQRQRQR
RSRSRSRSRSRSRSRSRSRSRSRSRS
STSTSTSTSTSTSTSTSTSTSTSTST
TUTUTUTUTUTUTUTUTUTUTUTUTU
UVUVUVUVUVUVUVUVUVUVUVUVUV
VWVWVWVWVWVWVWVWVWVWVWVWVW
WXWXWXWXWXWXWXWXWXWXWXWXWX
XYXYXYXYXYXYXYXYXYXYXYXYXY
YZYZYZYZYZYZYZYZYZYZYZYZYZ
ZAZAZAZAZAZAZAZAZAZAZAZAZA

Specs

• You can print all lowercase instead of all uppercase. However, case must be consistent throughout the output.
• You may print one extra trailing linefeed.

Scoring

Since this is an alphabet wave that fluctuates to a small extent, your code should also be small in terms of byte-count. In fact, the smallest code in terms of byte-count wins.

• Nathan Merrill: Seriously, another alphabet challenge?
• Conor O'Brien: @NathanMerrill As numerous as they are, I don't think they are worthy of downvotes. (I do not imply you downvoted, I am merely saying.)
• Dennis: As long as the patterns are sufficiently different, I don't think it matters if we use the alphabet, decimal digits, asterisks and underscore, etc.
• Nathan Merrill: @Dennis regardless of the characters used, its these type of "pattern" challenges that are getting overused, IMO. I don't think its offtopic, but I would enjoy some fresh air.
• trichoplax is on Codidact now: It's clear there's no more demand for alphabet challenges - only 39 people answered in the first 15 hours...

Answer 1

jq -nr, 41 bytes

range(26)|[(.+range(26)%2)%26+65]|implode

Try it online!

Answer 2

Java, 80 bytes

v->{for(int i=0;i<703;)System.out.printf("%c",i++%27>0?65+(i/27+i%27%2)%26:10);}

Based on @orlp's amazing answer, so also has a leading newline character.

Try it online.

Explanation:

v->{ // Method with empty unused parameter and no return
 for(int i=0;i<703;) // Loop `i` in the range [0,703):
 System.out.printf("%c", // Print a character with the following codepoint:
 i++%27>0? // If `i` is NOT divisible by 27:
 // (and increase `i` by 1 with `i++` afterwards)
 65+(i/27+i%27%2)%26 // The codepoint of the current letter to print
 : // Else:
 10);} // The codepoint of a newline character instead

Answer 3

MATLAB, (削除) 47 (削除ここまで) 38 bytes

a=(65:90)';char(repmat([a a([2:end 1])],1,13))
char(repmat([65:90;[66:90 65]]',1,13))

The first makes a column array of the alphabet in ASCII, appends a shifted copy as a column to its right, replicates the resulting 26*2 array 13 times columnwise, casts to a character array and prints by default.

The second makes a 2*26 array of alphabet and shifted alphabet, transposes it then continues as above.

• pajonk: You can save one byte using [... ''] instead of char(...).
• pajonk: And you can use simply [65:90;66:90 65] saving two bytes.

Answer 4

Neoscript, 59 bytes

a=('A:[]:'Z)+'Aeach n=0:[]:25console:log((a[n]+a[n+1])*13);

Answer 5

Javascript (using external library Enumerable) (84 bytes)

 n=>(w=_.Range(0,26)).WriteLine(x=>w.Write("",y=>String.fromCharCode((x+y%2)%26+65)))

Link to lib: https://github.com/mvegh1/Enumerable/

Code explanation: Create a range of ints starting at 0 for count of 26. Store into global variable w. For each, write a new line according to predicate. Predicate states to take "w" and write a joined string based off the passed predicate to Write. Predicate to Write uses an empty string as the join delimiter, and uses the current integer value from WriteLine ("x") and the current integer value from Write ("y") to calculate the correct string at that position

Edit: Removed extra parens to save 2 bytes

enter image description here

Answer 6

PHP, 102 bytes

<?php $a='ABCDEFGHIJKLMNOPQRSTUVWXYZA';$i=-1;while($i++<25){echo str_repeat(substr($a,$i,2),13)."\n";}

• Jeroen: You can remove the quotes from the Alphabet string. Replace \n with an actual enter instead of \n. Stole that idea from @insertusernamehere. So check his answer for what I mean. Edit: Also use the short-tag notation <?. You also do not need a space after <?. So <?$a='ABC' also works.

Answer 7

Ruby, 41 bytes

26.times{|i|puts [*?A..?Z,?A][i,2]*''*13}

Answer 8

PHP, 65 bytes

Well, this is pretty straight forward:

for(;$i<26;)echo str_repeat(chr(65+$i).chr(65+(++$i%26)),13)."
";

Answer 9

C#, 107 bytes

My first attempt at a submission to PPCG

Golfed:

var l="";int i=0,j=0;for(;i<26;i++){for(;j<26;j++)l+=(char)(((j%2)+i)%26+65);Console.WriteLine(l);l="";j=0;}

Ungolfed:

var l="";
int i=0,j=0;
for(;i<26;i++){
 for(;j<26;j++)l+=(char)(((j%2)+i)%26+65);
 Console.WriteLine(l);
 l="";j=0;
}

Pretty sure this adheres to standards! Would love to hear any potential improvements.

Answer 10

JavaScript (ES6), (削除) 88 (削除ここまで) 83 bytes

_=>[..."ABCDEFGHIJKLMNOPQRSTUVWXYZ"].map((c,i,a)=>(c+a[-~i%26]).repeat(13)).join`\n`

Where \n represents the literal newline character. Writing the alphabet out saved me three bytes today, but @LeakyNun saved me another five bytes.

• Leaky Nun: Did it save you four bytes yesterday?
• Leaky Nun: _=>[...s="ABCDEFGHIJKLMNOPQRSTUVWXYZ"].map((c,i)=>(c+s[-~i%26]).repeat(13)).join`\n`
• Neil: @LeakyNun No, just two, I'm afraid: codegolf.stackexchange.com/a/89297/17602
• gcampbell: The (c,i,a) is watching you.

Answer 11

C (86 bytes):

for(int c=-11,n=-26;++n<1;){while(c++){printf("%c%c",90+n,n?91+n:65);}c=-11;puts("");}

My first attempt on a Code Golf challenge.

Some answers are really impressive!

Answer 12

Python 2 53 bytes

i=0;exec'print(chr(i+65)+chr(-~i%26+65))*13;i+=1;'*26

Answer 13

Common Lisp, SBCL, 86 bytes

(dotimes(i 26)(format t"~13@{~a~:*~}~%"(subseq"ABCDEFGHIJKLMNOPQRSTUVWXYZA"i(+ i 2))))

Explanation

(dotimes(i 26);loop from i=0 to i=25
(format t"~13@{~a~:*~}~%"(subseq"ABCDEFGHIJKLMNOPQRSTUVWXYZA"i(+ i 2))))
;print 13 times pairs of "AB", "BC", ... , "ZA"

Answer 14

Bash + Unix utilities, (削除) 53 (削除ここまで) 52 bytes

dc "-e65[d257*1+16 52^65535/*POP1+d91>x]dsxx"|tr [ A

Try it online!

Test run:

dc "-e65[d257*1+16 52^65535/*POP1+d91>x]dsxx"|tr [ A
ABABABABABABABABABABABABAB
BCBCBCBCBCBCBCBCBCBCBCBCBC
CDCDCDCDCDCDCDCDCDCDCDCDCD
DEDEDEDEDEDEDEDEDEDEDEDEDE
EFEFEFEFEFEFEFEFEFEFEFEFEF
FGFGFGFGFGFGFGFGFGFGFGFGFG
GHGHGHGHGHGHGHGHGHGHGHGHGH
HIHIHIHIHIHIHIHIHIHIHIHIHI
IJIJIJIJIJIJIJIJIJIJIJIJIJ
JKJKJKJKJKJKJKJKJKJKJKJKJK
KLKLKLKLKLKLKLKLKLKLKLKLKL
LMLMLMLMLMLMLMLMLMLMLMLMLM
MNMNMNMNMNMNMNMNMNMNMNMNMN
NONONONONONONONONONONONONO
OPOPOPOPOPOPOPOPOPOPOPOPOP
PQPQPQPQPQPQPQPQPQPQPQPQPQ
QRQRQRQRQRQRQRQRQRQRQRQRQR
RSRSRSRSRSRSRSRSRSRSRSRSRS
STSTSTSTSTSTSTSTSTSTSTSTST
TUTUTUTUTUTUTUTUTUTUTUTUTU
UVUVUVUVUVUVUVUVUVUVUVUVUV
VWVWVWVWVWVWVWVWVWVWVWVWVW
WXWXWXWXWXWXWXWXWXWXWXWXWX
XYXYXYXYXYXYXYXYXYXYXYXYXY
YZYZYZYZYZYZYZYZYZYZYZYZYZ
ZAZAZAZAZAZAZAZAZAZAZAZAZA

Answer 15

SOGL V0.12, 8 bytes

Z«Z1'0∙I

Try it Here!

Explanation:

Z push the uppercase alphabet
 « put its first letter at the end
 Z push the alphabet once again
 1 wrap in array: ["BCDEFGHIJKLMNOPQRSTUVWXYZA", "ABCDEFGHIJKLMNOPQRSTUVWXYZ"]
 '0∙ multiply vertically 13 times
 I rotate clockwise

Answer 16

Bash, 64 bytes

f()(tr A-Z B-ZA|tee >(((i++<25))&&f);echo)
printf ZA%.s {a..m}|f

Credit to seshoumara's sed answer for the idea of translating A-Z to B-ZA.

Try it online!

Answer 17

c64 basic v2, (削除) 95 (削除ここまで) (削除) 93 (削除ここまで) (削除) 85 (削除ここまで) (削除) 83 (削除ここまで) 77 bytes

0fOy=65to90:l$="":a$=cH(y)+cH(y+1+(y=90)*26)
1fOx=0to12:l$=l$+a$:nE:?l$:nE

Screenshot:

enter image description here

Trial instructions are in my previous answer.

• mkst: can you switch out 0..25 for 65..90 in the first line? e.g. 0fOy=65to90:l$="":a$=chr$(y):b$=chr$(1+y):ify=90tHb$="a" for -3 bytes?
• peterh: @streetster Thanks! And I switched to conditional operator to avoid the if-then! :-) It is already 85. Screenshot follows.

Answer 18

Visual Basic .NET (Mono), 140 bytes

Module M
Sub Main
Dim I,J,S
For I=1To 26
S=""
For J=0To 11
S+=Chr$(I+64)+Chr$(I Mod 26+65)
Next
Console.WriteLine(S)
Next
End Sub
End Module

Try it online!

Answer 19

MY-BASIC, 77 bytes

For I=1 To 26
For J=0 To 12
Print Chr(I+64)+Chr(I Mod 26+65)
Next
Print;
Next

Try it online!

Answer 20

uBASIC, 83 bytes

0ForI=1To26:ForJ=0To12:?Left$(Chr$(I+64),1)+Left$(Chr$(IMod26+65),1);:NextJ:?:NextI

Try it online!

Answer 21

PHP, (削除) 78, 72, (削除ここまで) 67 bytes

<?php $s='A';while($s!='AA')echo str_repeat($s++.(--$s)[0],13)."
";

Try it online!

• Timtech: Instead of striking out old answers, just keep their bytecount in the header and strike those out. The revision history is sufficient in case you want to see older solutions.
• Link: @Timtech good point, thank you, Sir :)
• Timtech: Glad to help you out @Link, keep it up:)

Answer 22

APL (Dyalog Unicode), 13 bytes^SBCS

⍉(⎕a⌽⍨2|⊢)⌸⎕a

Try it online!

Answer 23

Charcoal, 15 bytes

E26⎇%ι2α+ΦαμA⟲6

Link is to verbose version of code.

Try it online!

Answer 24

Pip -n, 18 bytes

(z.z)@>_@<2X13M,26

Pip doesn't have transpose, so I just took two letter substrings and repeated them.

-n joins lists with newlines.

Try it online!

Answer 25

Jelly, 10 bytes

ØA,Ɲẋ13ドルj7

Try it online!

Noncompeting probably because some of the atoms are new.

Answer 26

Zsh, 46 bytes

p=A
for c ({B..Z} A)<<<${(el:52::$p$c:)}&&p=$c

Attempt This Online!

Answer 27

Knight, 34 bytes

;=a 65;W>90aO*+AaA=a+1a 13O*"ZA"13

Try it online!

Expanded code:

;=a 65
;WHILE > 90 a
 OUTPUT * (+(ASCII a) (ASCII (= a(+ 1 a)))) 13 
OUTPUT (* "ZA" 13)

There's probably a better way to deal with the last row, but I don't know it.

Another 34-byte solution:

;=a 0W>26aO*+A+65aA+65%=a+1a 26 13

Answer 28

Vyxal j, 7 bytes

kAǏz13*

Try it Online!

kA # uppercase alphabet
 Ǐ # Append the first letter
 z # Get overlapping pairs
 13* # Repeat each 13 times
 # (j flag) join by newlines

Answer 29

Japt (削除) -R (削除ここまで), (削除) 11 (削除ここまで) 9 bytes

;By@BéÓYv

Test it

;By@BéÓYv
;B :Uppercase alphabet
 y :Transpose
 @ :Pass each row through the following function and transpose back
 Bé : Rotate the alphabet right this many times
 Ó : Bitwise not of the negation of
 Y : 0-based index
 v : Parity

Answer 30

Julia, 51 bytes

!()=join(["$x$(x+1-26(x>89))"^13for x='A':'Z'],"
")

Initial golfing.