Confusing Alphabet Staircase

Question

Given no input, output this interesting alphabet pattern in either case (the case has to be consistent) via an accepted output method:

A
AB
ACBC
ADBDCD
AEBECEDE
AFBFCFDFEF
AGBGCGDGEGFG
AHBHCHDHEHFHGH
AIBICIDIEIFIGIHI
AJBJCJDJEJFJGJHJIJ
AKBKCKDKEKFKGKHKIKJK
ALBLCLDLELFLGLHLILJLKL
AMBMCMDMEMFMGMHMIMJMKMLM
ANBNCNDNENFNGNHNINJNKNLNMN
AOBOCODOEOFOGOHOIOJOKOLOMONO
APBPCPDPEPFPGPHPIPJPKPLPMPNPOP
AQBQCQDQEQFQGQHQIQJQKQLQMQNQOQPQ
ARBRCRDRERFRGRHRIRJRKRLRMRNRORPRQR
ASBSCSDSESFSGSHSISJSKSLSMSNSOSPSQSRS
ATBTCTDTETFTGTHTITJTKTLTMTNTOTPTQTRTST
AUBUCUDUEUFUGUHUIUJUKULUMUNUOUPUQURUSUTU
AVBVCVDVEVFVGVHVIVJVKVLVMVNVOVPVQVRVSVTVUV
AWBWCWDWEWFWGWHWIWJWKWLWMWNWOWPWQWRWSWTWUWVW
AXBXCXDXEXFXGXHXIXJXKXLXMXNXOXPXQXRXSXTXUXVXWX
AYBYCYDYEYFYGYHYIYJYKYLYMYNYOYPYQYRYSYTYUYVYWYXY
AZBZCZDZEZFZGZHZIZJZKZLZMZNZOZPZQZRZSZTZUZVZWZXZYZ

Trailing spaces and newlines are acceptable, standard loopholes are disallowed, and this happens to be code-golf, so the shortest answer in bytes wins!

Some people simply don't like these kind of challenges I think. — Jonathan Allan, Commented Jan 14, 2018 at 0:10

Chas Brown · Accepted Answer · 2018-01-14 01:14:46Z

1

Python 2, 92 86 79 75 64 bytes

s=map(chr,range(65,91))
for d in s:print d.join(s[:ord(d)-65])+d

Try it online!

11 bytes thx to Rod.

edited Jan 14, 2018 at 1:14

answered Jan 14, 2018 at 0:33

Chas Brown

9,7571 gold badge13 silver badges39 bronze badges

\$\begingroup\$ you don't need to use '\n'.join(..) \$\endgroup\$
– Rod
Commented Jan 14, 2018 at 1:03

Add a comment |

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

1

APL+WIN, 51 bytes

⍎∊'a←⎕av[65+⍳26]⋄a[n←1]',25⍴⊂'⋄,⊃a[⍳n-1],¨a[n←n+1]'

Explanation:

a←⎕av[65+⍳26] create a vector of upper case letters

a[n←1] first A

25⍴⊂'⋄,⊃a[⍳n-1],¨a[n←n+1]' create an implicit loop to concatenate subsequent letters

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Jan 14, 2018 at 9:49

Graham

6,8461 gold badge15 silver badges11 bronze badges

Add a comment |

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

><>, 47 bytes

d2*:1-v
-&$:?!\$:&$:1
1-:?!v\69*-$1-:
+*88~< 1o

Try it online!

How It Works:

d2*:1-v Initialise the stack with 26 (outer loop counter) and 26-1 (inner loop counter)
....
....
....

....
-&$:?!\$:&$:1 Repeatedly make copies of both counters
....          And decrement the inner loop counter
....          Go to third line when inner loop counter is 0

....            Add -54 to the stack (for the newline) and decrement the outer loop counter
....            Initialise the inner loop counter as outer-1
1-:?!v\69*-$1-: If the inner counter is 0, go to the fourth line, else back to the second.
....

....
....      
....      Transform numbers and -54s into letters and newlines by adding 64
+*88~< 1o Output each character until it runs out of stack and errors

dzaima · Accepted Answer · 2018-01-14 13:59:03Z

1

Canvas, 11 10 bytes

Ｚ｛Ｚ²╷ｍ¹＊×］

Try it here!

answered Jan 14, 2018 at 13:59

dzaima

20.3k2 gold badges41 silver badges75 bronze badges

Add a comment |

Thriller · Accepted Answer · 2018-01-14 18:04:31Z

1

GNU M4, 119 bytes

The worst so far. Well, time's already spent…

define(f,`ifelse($1,$2,,`format(%c%c,$1,$2)`'f(incr($1),$2)')')define(g,`f(65,$1)ifelse($1,90,,`
g(incr($1))')')A
g(66)

answered Jan 14, 2018 at 18:04

Thriller

1014 bronze badges

Add a comment |

Galen Ivanov · Accepted Answer · 2018-01-15 08:52:21Z

1

J, 38, 33 30 bytes

-5 bytes thanks to Bolce Bussiere

-3 bytes thanks to FrownyFrog

'A ',}.(}:,@,.{:)\(65+i.26){a.

How?

(65+i.26){a. - uppercase alphabet

\ - prefixes

(}:,@,.{:) - drops the last letter from each prefix and inserts it between the remaining letters

}. drops the leading row since it's empty (not "A")

, - append

'A ' - "A"

Try it online!

edited Jan 15, 2018 at 8:52

answered Jan 14, 2018 at 17:14

Galen Ivanov

21.2k3 gold badges24 silver badges61 bronze badges

1

\$\begingroup\$ You can use (,.'A') instead of ('A',49$' ') :) \$\endgroup\$
– Bolce Bussiere
Commented Jan 15, 2018 at 5:13
\$\begingroup\$ @Bolce Bussiere Thanks, it's much better now! \$\endgroup\$
– Galen Ivanov
Commented Jan 15, 2018 at 7:42
1

\$\begingroup\$ Just append 'A ' TIO \$\endgroup\$
– FrownyFrog
Commented Jan 15, 2018 at 8:47
\$\begingroup\$ @FrownyFrog Thanks! I didn't know it works. Only the space is used as a fill? \$\endgroup\$
– Galen Ivanov
Commented Jan 15, 2018 at 8:52
\$\begingroup\$ @GalenIvanov The space is the default fill, it doesn’t come from the 'A '. \$\endgroup\$
– FrownyFrog
Commented Jan 15, 2018 at 9:03

| Show 2 more comments

ბიმო · Accepted Answer · 2018-01-15 09:46:59Z

Husk, 13 bytes

Γ·:mhSzJḣ…"AZ

Try it online!

Explanation

This leading A really messes things up -.-

          "AZ  -- string literal: "AZ"
         …     -- fill gaps: "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
     S         -- with alphabet and
        ḣ      -- | alphabet rangified: ["A","AB","ABC",…,"AB……XYZ"]
      zJ       -- : zipWith join: ["A","ABB","ACBCC","ADBDCDD",…,"AZB……ZYZZ"]
Γ              -- pattern match (x:xs) with the following function (x is "A" and xs ["ABB","ACBCC",…,"A……ZYZZ"]
 · mh          -- | drop the last element of each element of xs: ["AB","ACBC",…,"A……ZYZ"]
  :            -- | cons (construct list): ["A","AB","ACBC",…,"A……ZYZ"]
               -- : strings are printed implicitly

Java Gonzar · Accepted Answer · 2018-01-15 11:24:40Z

1

Java 8, 121 bytes

I know there are better approaches but wanted to try it :)

q->{String s="";for(int i=0;i<26;i++){for(int j=0;j<((i<1)?1:i*2);j++){s+=(char)((j%2!=0?i:j/2)+65);}s+="\n";}return s;}

ungolfed:

static String d(){
    String s="";
    for(int i=0;i<26;i++){      //Loop for each line
        for(int j=0;j<((i<1)?1:i*2);j++){ //Loop to create the "word"
            s+=(char)((j%2!=0?i:j/2)+65);
        }
        s+="\n";
    }
    return s;
}

edited Jan 15, 2018 at 11:24

answered Jan 15, 2018 at 11:14

Java Gonzar

1937 bronze badges

\$\begingroup\$ 110 bytes \$\endgroup\$
– ceilingcat
Commented Dec 5, 2019 at 21:41

Add a comment |

Galen Ivanov · Accepted Answer · 2018-01-15 11:49:16Z

1

Red, 130 122 bytes

prin"A"repeat n 26[b: copy/part"ABCDEFGHIJKLMNOPQRSTUVWXYZ"n
foreach d copy/part b back tail b[prin d prin last b]print""]

Try it online!

edited Jan 15, 2018 at 11:49

answered Jan 15, 2018 at 11:15

Galen Ivanov

21.2k3 gold badges24 silver badges61 bronze badges

Add a comment |

aloisdg · Accepted Answer · 2018-01-15 15:49:40Z

1

F# (.NET Core), 132 bytes

let x=['A'..'Z']|>Seq.map(fun c->(+)(['A'..'Z']|>Seq.take((int c)-65)|>Seq.map(fun s->string s)|>String.concat(string c))(string c))

Try it online!

A naive port of my C# answer

answered Jan 15, 2018 at 15:49

aloisdg

2,07717 silver badges26 bronze badges

Add a comment |

Brad Gilbert b2gills · Accepted Answer · 2018-01-16 00:50:53Z

Perl 6, 51 bytes

.say for 'A',{join |('A'..'Z')[++$,^++$ ],''}.../Z/

Try it

Expanded:

.say     # print with trailing newline

  for    # each of the following

    # start the sequence
    'A',

    # code used to generate the rest of the sequence
    {
      join
        | # flatten arguments

        ( 'A' .. 'Z' )[  # Range of characters
          ++$,           # auto incrementing anon state var (value used to join)
          ^++$           # Range upto an incrementing anon
        ],
        ''               # an empty string so that the joiner is added to end
    }

    ...  # keep doing that until
    /Z/  # there is a "Z" in the value

Taylor Raine · Accepted Answer · 2018-01-31 06:00:07Z

1

uBASIC, 80 bytes

Anonymous function that takes no input and outputs to the console

0?"A":ForI=65To89:ForJ=65ToI:?Left$(Chr$(J),1)+Left$(Chr$(I+1),1);:NextJ:?:NextI

Try it online!

answered Jan 31, 2018 at 6:00

Taylor Raine

8,7462 gold badges27 silver badges51 bronze badges

Add a comment |

Taylor Raine · Accepted Answer · 2018-01-31 06:10:38Z

1

Visual Basic .NET (Mono), 134 bytes

Declared function that takes no input and outputs to the console

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

Try it online!

answered Jan 31, 2018 at 6:10

Taylor Raine

8,7462 gold badges27 silver badges51 bronze badges

Add a comment |

Taylor Raine · Accepted Answer · 2018-04-12 02:04:49Z

1

MY-BASIC, 77 bytes

Anonymous function that takes no input and outputs to the console.

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

Try it online!

edited Apr 12, 2018 at 2:04

answered Jan 31, 2018 at 6:03

Taylor Raine

8,7462 gold badges27 silver badges51 bronze badges

Add a comment |

Taylor Raine · Accepted Answer · 2018-07-10 17:02:05Z

1

Yabasic, 60 bytes

?"A"
For I=65To 89
For J=65To I?Chr$(J)+Chr$(I+1);Next
?Next

Try it online!

edited Jul 10, 2018 at 17:02

answered Jan 31, 2018 at 20:14

Taylor Raine

8,7462 gold badges27 silver badges51 bronze badges

Add a comment |

Taylor Raine · Accepted Answer · 2018-07-10 17:12:24Z

1

QBasic 1.1, 62 bytes

Takes no input and outputs to the STDIN

?"A"
FOR i=65TO 89
FOR j=65TO i
?CHR$(j)CHR$(i+1);
NEXT
?
NEXT

answered Jul 10, 2018 at 17:12

Taylor Raine

8,7462 gold badges27 silver badges51 bronze badges

Add a comment |

JohnWells · Accepted Answer · 2018-07-12 19:11:41Z

1

Kotlin, 76 bytes

{for(l in 'A'..'Z'){for(c in 'A'..l){print(c)
if(c+1<l)print(l)}
println()}}

Try it online!

answered Jul 12, 2018 at 19:11

JohnWells

7013 silver badges7 bronze badges

Add a comment |

Dom Hastings · Accepted Answer · 2018-07-13 12:05:43Z

1

Perl 5, 35 bytes

@a=A..$_,$"=pop@a,say"@a$_"for A..Z

Try it online!

I managed to get frustratingly close for 23 bytes, but the above is the shortest valid solution I've managed so far:

$,=$_,say A..$,for A..Z

Try it online!

answered Jul 13, 2018 at 12:05

Dom Hastings

24.4k4 gold badges56 silver badges93 bronze badges

Add a comment |

MarcMush · Accepted Answer · 2023-11-08 21:41:23Z

1

Julia 1.0, 40 bytes

!_=["A";'B':'Z'.|>i->join(('A':i-1).*i)]

Try it online!

function taking an unused argument and ouputing an array of strings

answered Nov 8, 2023 at 21:41

MarcMush

6,63513 silver badges17 bronze badges

Add a comment |

GammaFunction · Accepted Answer · 2023-11-08 21:56:45Z

1

Zsh, 40 bytes

for c ({A..Z})<<<${(pj:$c:)s}$c&&s+=($c)

Try it online!

for c ({A..Z})             # for each character
    <<< ${(pj:$c:)s}$c &&  # print line
    #   ${(p     ) }       # - enable simple $parameters inside PE flags
    #   ${( j:$c:) }       # - join with $c
    #   ${        s}$c     # - concatenate $s with $c
    s+=($c)                # add $c to the end of the list $s

answered Nov 8, 2023 at 21:56

GammaFunction

6,91413 silver badges23 bronze badges

Add a comment |

lyxal · Accepted Answer · 2024-08-01 05:56:33Z

Vyxal `j`, 7 bytes

n¦ƛṫ~jp

Try it Online!

Explained

n¦ƛṫ~jp⁡‎‎⁪⁡⁪⁠⁪⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁪‏‏⁡⁠⁡‌⁢‎‎⁪⁡⁪⁠⁪⁣⁪‏‏⁡⁠⁡‌⁣‎‎⁪⁡⁪⁠⁪⁤⁪‏‏⁡⁠⁡‌⁤‎‎⁪⁡⁪⁠⁪⁢⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁪‏‏⁡⁠⁡‌⁢⁡‎‎⁪⁡⁪⁠⁪⁢⁣⁪‏‏⁡⁠⁡‌
n¦       # ‎⁡Prefixes of the alphabet
  ƛ      # ‎⁢To each prefix:
   ṫ     # ‎⁣  push prefix[:-1], prefix[-1]
    ~j   # ‎⁤  without popping anything, join the long string on the short string
      p  # ‎⁢⁡  and append prefix[-1]
💎

Created with the help of Luminespire.

bb94 · Accepted Answer · 2024-08-12 00:45:42Z

Setanta, 100 bytes

S:=scriobh S("A")s:="ABCDEFGHIJKLMNOPQRSTUVWXYZ"le i idir(0,26){t:=""le j idir(0,i)t+=s[j]+s[i]S(t)}

try-setanta.ie link

Explanation

S:=scriobh S("A")s:="ABCDEFGHIJKLMNOPQRSTUVWXYZ"le i idir(0,26){t:=""le j idir(0,i)t+=s[j]+s[i]S(t)}⁡‎‎⁪⁡⁪⁠⁪⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁡⁪‏‏⁡⁠⁡‌⁢‎‎⁪⁡⁪⁠⁪⁢⁡⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁣⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁣⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁣⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁣⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁤⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁤⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁤⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁤⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁡⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁡⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁡⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁡⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁢⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁢⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁢⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁢⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁣⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁣⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁣⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁣⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁤⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁤⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁤⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁣⁤⁤⁪‏‏⁡⁠⁡‌⁣‎‎⁪⁡⁪⁠⁪⁤⁡⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁡⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁡⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁡⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁢⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁢⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁢⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁢⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁣⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁣⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁣⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁣⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁤⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁤⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁤⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁤⁤⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁣⁡⁤⁪‏‏⁡⁠⁡‌⁤‎‎⁪⁡⁪⁠⁪⁢⁡⁢⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁢⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁢⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁣⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁣⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁣⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁣⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁤⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁤⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁤⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁤⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁡⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁡⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁡⁣⁪‏‏⁡⁠⁡‌⁢⁡‎‎⁪⁡⁪⁠⁪⁢⁡⁡⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁡⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁡⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁡⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁡⁢⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁡⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁢⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁢⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁢⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁢⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁣⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁣⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁣⁣⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁣⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁤⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁤⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁢⁤⁣⁪‏‏⁡⁠⁡‌⁢⁢‎‎⁪⁡⁪⁠⁪⁢⁢⁤⁤⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁣⁡⁡⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁣⁡⁢⁪‏⁠‎⁪⁡⁪⁠⁪⁢⁣⁡⁣⁪‏‏⁡⁠⁡‌
S:=scriobh S("A")                                                                                     # ‎⁡Prints "A"
                 s:="ABCDEFGHIJKLMNOPQRSTUVWXYZ"                                                      # ‎⁢Assigns "ABC...XYZ" to s (since Setanta doesn’t have a chr function)
                                                le i idir(0,26){                                   }  # ‎⁣For i in [0, 26)...
                                                                     le j idir(0,i)                   # ‎⁤For j in [0, i)...
                                                                t:=""              t+=s[j]+s[i]       # ‎⁢⁡Appends s[j] + s[i] to the string
                                                                                               S(t)   # ‎⁢⁢Prints the string
💎

Created with the help of Luminespire.

Οurous · Accepted Answer · 2018-01-14 00:04:59Z

0

Clean, 74 72 bytes

import StdEnv
Start=("A",[(zip2['A'..s-one][s,s..],'
')\\s<-['A'..'Z']])

Try it online!

This actually doesn't print a String, but rather a bare (String, [([(Char, Char)], Char)]), which is functionally the same. Unless you grab the output from this with another Clean program.

edited Jan 14, 2018 at 0:04

answered Jan 13, 2018 at 23:56

Οurous

8,1271 gold badge16 silver badges38 bronze badges

Add a comment |

gastropner · Accepted Answer · 2018-01-15 09:08:19Z

0

C (gcc), 77 bytes

f(i,j){for(i=0;i<26;puts("A"+!!i++))for(j=0;j<i;)printf("%c%c",j+++65,i+65);}

Try it online!

answered Jan 15, 2018 at 9:08

gastropner

4,4131 gold badge15 silver badges20 bronze badges

Add a comment |

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

0

VBA, 60 Bytes

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

?"A":For i=65To 89:For j=65To i:?Chr(j)Chr(i+1);:Next:?:Next

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Jan 15, 2018 at 12:02

Taylor Raine

8,7462 gold badges27 silver badges51 bronze badges

Add a comment |

Quadruplay · Accepted Answer · 2024-03-30 01:20:00Z

Easyfuck, 36 bytes

\ùòG^EPAí½xÑZG×í½x¹ZGË¯Ýz^SHYòGË^PM<¿v␄␘6Å␀ÿ

^{due to lack of unicode representations for c1 control characters, they have been replaced by their superscripted abbreviations}

Decompressed:

.>>$<_[=<4+$>_[=<.+$>._]=+>$>.<<_]@AA[␊

Explanation:

.>>$<_[=<4+$>_[=<.+$>._]=+>$>.<<_]@AA[␊
.>>$<                                   print the initial A
     _[=                        _]      loop until 2nd cell is equal to 3rd
        <4+$>                           set first cell to A
             _[=      _]=               loop until 1st cell is equal to 2nd
                <.+$>.                  print 1st cell and increment it, then print 2nd
                         +>$>.<<        increment 2nd cell and print 4th
                                  @     return
                                   AA[␊ initializer data

Stack Exchange Network

Confusing Alphabet Staircase

56 Answers 56

Python 2, 92 86 79 75 64 bytes

APL+WIN, 51 bytes

><>, 47 bytes

How It Works:

Canvas, 11 10 bytes

GNU M4, 119 bytes

J, 38, 33 30 bytes

How?

Husk, 13 bytes

Explanation

Java 8, 121 bytes

Red, 130 122 bytes

F# (.NET Core), 132 bytes

Perl 6, 51 bytes

Expanded:

uBASIC, 80 bytes

Visual Basic .NET (Mono), 134 bytes

MY-BASIC, 77 bytes

Yabasic, 60 bytes

QBasic 1.1, 62 bytes

Kotlin, 76 bytes

Perl 5, 35 bytes

Julia 1.0, 40 bytes

Zsh, 40 bytes

Vyxal `j`, 7 bytes

Explained

Setanta, 100 bytes

Explanation

Clean, 74 72 bytes

C (gcc), 77 bytes

VBA, 60 Bytes

Easyfuck, 36 bytes

Your Answer

Not the answer you're looking for? Browse other questions tagged
code-golf
kolmogorov-complexity
alphabet
or ask your own question.

Linked

Hot Network Questions

Confusing Alphabet Staircase

56 Answers 56

Python 2, 92 86 79 75 64 bytes

APL+WIN, 51 bytes

><>, 47 bytes

How It Works:

Canvas, 11 10 bytes

GNU M4, 119 bytes

J, 38, 33 30 bytes

How?

Husk, 13 bytes

Explanation

Java 8, 121 bytes

Red, 130 122 bytes

F# (.NET Core), 132 bytes

Perl 6, 51 bytes

Expanded:

uBASIC, 80 bytes

Visual Basic .NET (Mono), 134 bytes

MY-BASIC, 77 bytes

Yabasic, 60 bytes

QBasic 1.1, 62 bytes

Kotlin, 76 bytes

Perl 5, 35 bytes

Julia 1.0, 40 bytes

Zsh, 40 bytes

Vyxal j, 7 bytes

Explained

Setanta, 100 bytes

Explanation

Clean, 74 72 bytes

C (gcc), 77 bytes

VBA, 60 Bytes

Easyfuck, 36 bytes

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golfkolmogorov-complexityalphabet or ask your own question.

Linked

Related

Hot Network Questions

Vyxal `j`, 7 bytes

Not the answer you're looking for? Browse other questions tagged
code-golf
kolmogorov-complexity
alphabet
or ask your own question.