Make an alphabet searchlight!

Question

Inspired by a bug in a solution to this challenge, your challenge is to produce this exact text:

                         ZYXWVUTSRQPONMLKJIHGFEDCBA
                        YXWVUTSRQPONMLKJIHGFEDCBA
                       XWVUTSRQPONMLKJIHGFEDCBA
                      WVUTSRQPONMLKJIHGFEDCBA
                     VUTSRQPONMLKJIHGFEDCBA
                    UTSRQPONMLKJIHGFEDCBA
                   TSRQPONMLKJIHGFEDCBA
                  SRQPONMLKJIHGFEDCBA
                 RQPONMLKJIHGFEDCBA
                QPONMLKJIHGFEDCBA
               PONMLKJIHGFEDCBA
              ONMLKJIHGFEDCBA
             NMLKJIHGFEDCBA
            MLKJIHGFEDCBA
           LKJIHGFEDCBA
          KJIHGFEDCBA
         JIHGFEDCBA
        IHGFEDCBA
       HGFEDCBA
      GFEDCBA
     FEDCBA
    EDCBA
   DCBA
  CBA
 BA
A

The first line will have 25 spaces, then the alphabet backwards starting from the 26th letter (ZYXWVUTSRQPONMLKJIHGFEDCBA), then a newline.
The second line will have 24 spaces, then the alphabet backwards starting from the 25th letter (YXWVUTSRQPONMLKJIHGFEDCBA), then a newline.
...
The last (26th) line will have no spaces, then the alphabet backwards starting from the 1st letter (A), then a newline.

Additional rules:

Your program may use any allowed output methods.
One trailing newline and/or one leading newline is allowed.
There must be one newline between lines containing the letters, no more.
The letters must be all uppercase.

As with code-golf, the shortest submission wins. Good luck!

Leaderboard:

var QUESTION_ID=141725,OVERRIDE_USER=61563;function answersUrl(e){return"https://api.stackexchange.com/2.2/questions/"+QUESTION_ID+"/answers?page="+e+"&pagesize=100&order=desc&sort=creation&site=codegolf&filter="+ANSWER_FILTER}function commentUrl(e,s){return"https://api.stackexchange.com/2.2/answers/"+s.join(";")+"/comments?page="+e+"&pagesize=100&order=desc&sort=creation&site=codegolf&filter="+COMMENT_FILTER}function getAnswers(){jQuery.ajax({url:answersUrl(answer_page++),method:"get",dataType:"jsonp",crossDomain:!0,success:function(e){answers.push.apply(answers,e.items),answers_hash=[],answer_ids=[],e.items.forEach(function(e){e.comments=[];var s=+e.share_link.match(/\d+/);answer_ids.push(s),answers_hash[s]=e}),e.has_more||(more_answers=!1),comment_page=1,getComments()}})}function getComments(){jQuery.ajax({url:commentUrl(comment_page++,answer_ids),method:"get",dataType:"jsonp",crossDomain:!0,success:function(e){e.items.forEach(function(e){e.owner.user_id===OVERRIDE_USER&&answers_hash[e.post_id].comments.push(e)}),e.has_more?getComments():more_answers?getAnswers():process()}})}function getAuthorName(e){return e.owner.display_name}function process(){var e=[];answers.forEach(function(s){var r=s.body;s.comments.forEach(function(e){OVERRIDE_REG.test(e.body)&&(r="<h1>"+e.body.replace(OVERRIDE_REG,"")+"</h1>")});var a=r.match(SCORE_REG);a&&e.push({user:getAuthorName(s),size:+a[2],language:a[1],link:s.share_link})}),e.sort(function(e,s){var r=e.size,a=s.size;return r-a});var s={},r=1,a=null,n=1;e.forEach(function(e){e.size!=a&&(n=r),a=e.size,++r;var t=jQuery("#answer-template").html();t=t.replace("{{PLACE}}",n+".").replace("{{NAME}}",e.user).replace("{{LANGUAGE}}",e.language).replace("{{SIZE}}",e.size).replace("{{LINK}}",e.link),t=jQuery(t),jQuery("#answers").append(t);var o=e.language;/<a/.test(o)&&(o=jQuery(o).text()),s[o]=s[o]||{lang:e.language,user:e.user,size:e.size,link:e.link}});var t=[];for(var o in s)s.hasOwnProperty(o)&&t.push(s[o]);t.sort(function(e,s){return e.lang>s.lang?1:e.lang<s.lang?-1:0});for(var c=0;c<t.length;++c){var i=jQuery("#language-template").html(),o=t[c];i=i.replace("{{LANGUAGE}}",o.lang).replace("{{NAME}}",o.user).replace("{{SIZE}}",o.size).replace("{{LINK}}",o.link),i=jQuery(i),jQuery("#languages").append(i)}}var ANSWER_FILTER="!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe",COMMENT_FILTER="!)Q2B_A2kjfAiU78X(md6BoYk",answers=[],answers_hash,answer_ids,answer_page=1,more_answers=!0,comment_page;getAnswers();var SCORE_REG=/<h\d>\s*([^\n,]*[^\s,]),.*?(\d+)(?=[^\n\d<>]*(?:<(?:s>[^\n<>]*<\/s>|[^\n<>]+>)[^\n\d<>]*)*<\/h\d>)/,OVERRIDE_REG=/^Override\s*header:\s*/i;

body{text-align:left!important}#answer-list,#language-list{padding:10px;width:290px;float:left}table thead{font-weight:700}table td{padding:5px}

<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script> <link rel="stylesheet" type="text/css" href="//cdn.sstatic.net/codegolf/all.css?v=83c949450c8b"> <div id="answer-list"> <h2>Leaderboard</h2> <table class="answer-list"> <thead> <tr><td></td><td>Author</td><td>Language</td><td>Size</td></tr></thead> <tbody id="answers"> </tbody> </table> </div><div id="language-list"> <h2>Winners by Language</h2> <table class="language-list"> <thead> <tr><td>Language</td><td>User</td><td>Score</td></tr></thead> <tbody id="languages"> </tbody> </table> </div><table style="display: none"> <tbody id="answer-template"> <tr><td>{{PLACE}}</td><td>{{NAME}}</td><td>{{LANGUAGE}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr></tbody> </table> <table style="display: none"> <tbody id="language-template"> <tr><td>{{LANGUAGE}}</td><td>{{NAME}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr></tbody> </table>

\$\begingroup\$ To me it looks like the light cast by the bat-signal \$\endgroup\$
– scottinet
Sep 5, 2017 at 19:47 — scottinet, Sep 5, 2017 at 19:47
\$\begingroup\$ Closely Related. \$\endgroup\$
– Mr. Xcoder
Sep 5, 2017 at 20:26 — Mr. Xcoder, Sep 5, 2017 at 20:26
\$\begingroup\$ Can each line have an extra space in front of it? \$\endgroup\$
– hyper-neutrino ♦
Sep 5, 2017 at 20:35 — hyper-neutrino, Sep 5, 2017 at 20:35
\$\begingroup\$ Could each line have trailing spaces after the last letter? \$\endgroup\$
– miles
Sep 5, 2017 at 20:49 — miles, Sep 5, 2017 at 20:49
\$\begingroup\$ @miles yes, that's fine. \$\endgroup\$
– MD XF
Sep 5, 2017 at 21:34 — MD XF, Sep 5, 2017 at 21:34

Arcterus · Accepted Answer · 2018-04-22 07:14:22Z

1

Rust, 87 bytes

fn main(){for i in 0..26{println!("{:>1$}",&"ZYXWVUTSRQPONMLKJIHGFEDCBA"[i..],51-2*i)}}

With Spaces and Indentation

fn main() {
    for i in 0..26 {
        println!("{:>1$}", &"ZYXWVUTSRQPONMLKJIHGFEDCBA"[i..], 51-2*i)
    }
}

Try it online

answered Apr 22, 2018 at 7:14

Arcterus

211 bronze badge

Add a comment |

X1M4L · Accepted Answer · 2018-04-23 08:03:11Z

Emojicode, 156 bytes

🏁🍇🍦a🔤                         ZYXWVUTSRQPONMLKJIHGFEDCBA🔤🍮i 0🔁◀i 26🍇😀🍪🔪a i➖25 i🔪a➕i 25🐔a🍪🍮i➕i 1🍉🍉

Try it online!

Explanation:

🏁🍇     👴 start program
🍦a🔤                         ZYXWVUTSRQPONMLKJIHGFEDCBA🔤     👴 big ol string
🍮i 0           👴 declare loop variable
    🔁◀i 26🍇      👴 loop 26 times
        😀🍪         👴 print concatenated string 
        🔪a i➖25 i     👴 number of spaces
        🔪a➕i 25🐔a🍪     👴 reverse alphabet minus last letter
        🍮i➕i 1       👴 increment loop variable
    🍉              👴 end loop
🍉                 👴 end program

snail_ · Accepted Answer · 2018-04-25 19:47:04Z

1

SmileBASIC 3, 67 64 bytes

-3 bytes from @12Me21 using the -I trick

Unfortunately the console is one character too narrow to fit the first line without wrapping the last character. Oh well.

FOR I=-25TO.?" "*-I+RIGHT$(@ZYXWVUTSRQPONMLKJIHGFEDCBA,-I+1)NEXT

edited Apr 25, 2018 at 19:47

answered Apr 21, 2018 at 19:05

snail_

2,64211 silver badges16 bronze badges

\$\begingroup\$ There's a neat trick you can do to avoid STEP -1. Make the loop go from -25 to 0, and use -I instead of I. \$\endgroup\$
– 12Me21
Apr 25, 2018 at 12:37

Add a comment |

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

1

Swift, 118 bytes

var s="";for i in 0..<26{for _ in 0..<25-i{s+=" "};for j in 0..<26-i{s+="\(UnicodeScalar(90-i-j)!)"};s+="\n"};print(s)

Prettyfied:

var s = ""

for i in 0 ..< 26 {
    for _ in 0 ..< 25 - i {
        s += " "
    }

    for j in 0 ..< 26 - i {
        s += "\(UnicodeScalar(90 - i - j)!)"
    }
   
    s += "\n"
}  

print(s)

Try it online!

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Apr 26, 2018 at 14:42

Tamás Sengel

2111 silver badge10 bronze badges

Add a comment |

Khuldraeseth na'Barya · Accepted Answer · 2018-05-02 15:21:21Z

Stax, 13 9 bytes

á*↔?[O╒v4

Run and debug it at staxlang.xyz!

Unpacked (15 bytes) and explanation

VAr|]mc%Hv)
VAr                Uppercase alphabet, reversed
   |]              List of suffixes
     m             Map rest of program over array, printing each element with a linefeed:
      c              Copy top of stack
       %             Length
        Hv           Double and decrement
          )          Pad string on left with spaces to the specified length

~~I think that VAr|]mc%Hv|z SHOULD work for 10 bytes (once packed), but what looks to me like a bug kills that solution.~~ I stupidly confused |z with ) there. Thanks @recursive for pointing that out (and saving even another byte)!

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

1

T-SQL, 115 bytes

DECLARE @ VARCHAR(51)=SPACE(25)+'ZYXWVUTSRQPONMLKJIHGFEDCBA'a:PRINT @
SET @=STUFF(@,len(@)/2,2,'')IF len(@)>0GOTO a

Shorter to just hard-code the initial string, then I used STUFF() to snip out two characters from the middle each loop.

I can save 3 bytes by using a CHAR(51) instead of a VARCHAR(51), but that prints full-width trailing spaces for all rows, which don't appear to be allowed.

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered May 2, 2018 at 16:32

BradC

6,7671 gold badge13 silver badges34 bronze badges

Add a comment |

Hille · Accepted Answer · 2018-05-03 12:38:33Z

C# (.NET Core), 133 114 bytes

var S="";for(int I=26;I-->0;){var C='@';for(;C++<I+64;)S+=" ";for(;C>'@';)S+=C--;S+="\n";}System.Console.Write(S);

Try it online!

var S="";                   // Initialize the return string
for(int I=26;I-->0;){       // For all 26 rows (with I as the space count)
    var C='@';              // Initializing C with the char '@' which is one under 'A'
    for(;C++<I+64;)         // For all spaces needed and sets the char one up ('@' -> 'A', 'A' -> 'B')
        S+=" ";             // Add a space to the string
    for(;C>'@';)            // For all characters which are needed from the char countet above up down to 'A'
        S+=C;               // Add the char to the string
    S+="\n";                // Add a new line to the string
}
System.Console.Write(S);    // Output the string

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

K4, 22 bytes

Solution:

,/'(1_')\0 25_|51$.Q.A

Explanation:

Generate two lists and reduce each until they are empty.

,/'(1_')\0 25_|51$.Q.A / the solution
                  .Q.A / A..Z
               51$     / pad to 51 chars
              |        / reverse it
         0 25_         / cut (_) at indices 0 and 25
   (   )\              / perform this along
    1_'                / drop (_) first from each (') list
,/'                    / flatten (,/) each (')

Bonus:

Another 22 byte solution:

,/'(1_')\(25#$`;|.Q.A)

Emigna · Accepted Answer · 2019-03-13 19:45:00Z

1

><>, 51 49 bytes

2d*:&:1(?v:"@"+$1-48*}40.
l2(?vob1.>r~
-20.>~ao&1

Try it online!

edited Mar 13, 2019 at 19:45

answered Mar 13, 2019 at 19:24

Emigna

52.9k5 gold badges42 silver badges162 bronze badges

Add a comment |

Ven · Accepted Answer · 2019-04-09 11:01:11Z

1

Dyalog APL, 34 23 21 bytes^SBCS

↑{(1-2×⍵)↑⌽⍵↑⎕A}¨⌽⍳26

Try it online!

Thanks to Adám for the help!

Explanation:

↑{(1-2×⍵)↑⌽⍵↑⎕A}¨⌽⍳26
                  ⍳26 ⍝ 1..26
                 ⌽    ⍝ Reverse, 26..1
 {             }¨     ⍝ For each in this range. Iteration: ⍵
            ↑         ⍝ Take...
           ⍵          ⍝ ...⍵ elements...
             ⎕A       ⍝ ...from the alphabet
          ⌽           ⍝ Reverse
         ↑            ⍝ Pad with spaces...
  (1-2×⍵)             ⍝ ...(1 - 2*current iteration) elements
↑                     ⍝ Format

edited Apr 9, 2019 at 11:01

answered Sep 7, 2017 at 12:12

Ven

3,4631 gold badge18 silver badges24 bronze badges

\$\begingroup\$ You have a stray ⌷. \$\endgroup\$
– Adám
Sep 7, 2017 at 12:18
\$\begingroup\$ Also, I'd write ↑ instead of ⍪. \$\endgroup\$
– Adám
Sep 7, 2017 at 12:19
\$\begingroup\$ Save two bytes: ↑{(1-2×⍵)↑⌽⍵↑⎕A}¨⌽⍳26 \$\endgroup\$
– Adám
Sep 7, 2017 at 12:25
\$\begingroup\$ That's clever :). Ty. \$\endgroup\$
– Ven
Sep 7, 2017 at 12:32

Add a comment |

Giuseppe · Accepted Answer · 2019-04-09 17:12:55Z

1

Gaia, 14 bytes

26…v§&¦₵Av┅+†ṣ

Try it online!

answered Apr 9, 2019 at 17:12

Giuseppe

28.1k3 gold badges30 silver badges101 bronze badges

Add a comment |

Value Ink · Accepted Answer · 2019-10-09 00:27:13Z

1

Ruby, 58 bytes

Not the best answer for Ruby, but still good enough to get second place out of three entries lol. I just wanted to try a regex-based solution.

s=' '*26+[*?A..?[].reverse*''
puts s while s.sub!(/ \S/){}

Try it online!

answered Oct 9, 2019 at 0:27

Value Ink

12.5k1 gold badge16 silver badges42 bronze badges

Add a comment |

Shaggy · Accepted Answer · 2020-11-10 17:02:32Z

1

Japt `-R`, 15 12 11 bytes

;Båi ËiEçÃÔ

Test it

;Båi ËiEçÃÔ
;B              :Uppercase alphabet
  å             :Cumulatively reduce by
   i            :  Prepending
     Ë          :Map each element a 0-based index E
      i         :  Prepend
       Eç       :  Space repeated E times
         Ã      :End map
          Ô     :Reverse
                :Implicit output joined with newlines

edited Nov 10, 2020 at 17:02

answered Sep 5, 2017 at 20:24

Shaggy

41.6k4 gold badges34 silver badges92 bronze badges

Add a comment |

DLosc · Accepted Answer · 2021-05-10 04:47:17Z

Pip `-l`, 18 bytes

R R*AZ@,\,26.sX,26

Run it here! Alternately, here's the equivalent 19-byte solution in an older version of Pip: Try it online!

Explanation

               ,26  Range(26)
             sX      String-multiply each element by space: list of 0 to 25 spaces
        \,26        Inclusive-range(1,26)
       ,             Range(each element)
      @              Use each range as an index into...
    AZ               Uppercase alphabet
            .       Concatenate those two lists itemwise
  R*                Reverse each string in the resulting list
R                   Reverse the list itself
                    Autoprint the list, one string per line (-l flag)

Another 18-byte answer using map:

RAZ@,1+_.sX_M R,26

Try it online! (19-byte equivalent)

wen1k · Accepted Answer · 2021-05-12 12:02:59Z

1

Lua, 82 bytes

s=' 'for i=90,65,-1 do o=s:rep(i-65)for j=i,65,-1 do o=o..s.char(j)end print(o)end

Try it online!

Human readable code:

s=' '
for i=90,65,-1 do
  o=s:rep(i-65)
  for j=i,65,-1 do
    o=o..s.char(j)
  end
  print(o)
end

answered May 12, 2021 at 12:02

wen1k

536 bronze badges

Add a comment |

RezNesX · Accepted Answer · 2021-05-12 12:28:12Z

1

BRASCA, 23 bytes

e[{:[Eo{]x:}[{:D+o]lox]

Try it online!

answered May 12, 2021 at 12:28

RezNesX

6994 silver badges7 bronze badges

Add a comment |

pxeger · Accepted Answer · 2021-05-12 12:46:29Z

Zsh, 41 bytes

eval 1={A..Z}'$1;<<<${(l:#1-65:)}$1;'|tac

Try it online!

Explanation:

1={A..Z}'$1;<<<${(l:#1-65:)}$1;': construct the string 1=A$1;<<<${(l:#1-65:)}$1; 1=B...1; 1=C...1; ... 1=Z...1; (with every letter from A to Z in place of the {A..Z} in each case)
evaluate that string as zsh code:
- 1=A$1: prepend A (or which ever letter is in that repetition) to the variable $1
- ${(l:#1-65:)}: generate #1-65 spaces:
  - #1: Take the ASCII character code of the first character of $1
  - subtract 65. The first iteration will have A as the first character of $1, the character code of which is 65, and since 65-65=0, no spaces will be printed. Then for further letters, another space will be added each time.
- $1: and append the variable $1
- <<<: and print that with a newline
|tac and reverse the output line-wise

Zsh, 36 bytes

eval 2={A..Z}'$2;<<<$1$2;1+=\ ;'|tac

Try it online!

Dom Hastings · Accepted Answer · 2021-08-13 11:25:58Z

1

Elixir, 84 bytes

import Enum
map 25..0,&(IO.puts List.duplicate(' ',&1)++reverse(slice ?A..?Z,0..&1))

Try it online!

Still want to find a way around that List.duplicate call....

edited Aug 13, 2021 at 11:25

answered Jul 21, 2021 at 18:00

Dom Hastings

23k3 gold badges52 silver badges91 bronze badges

Add a comment |

Bubbler · Accepted Answer · 2019-10-12 08:03:47Z

Forth (gforth), 54 bytes

: f for i spaces i for i 65 + emit next cr next ;
25 f

Try it online!

How it works

: f ( n -- ) \ Print n+1 lines of searchlight.
  for        \ loop from n to 0 inclusive [i]
    i spaces   \ print i spaces
    i for      \ loop from i to 0 inclusive [j];
               \ in Forth, the innermost loop count is always i
      i 65 + emit \ print a char whose charcode is j + 65
    next       \ end inner loop
    cr         \ print a newline
  next ;     \ end outer loop
25 f       \ push 25 and call f

Just started fiddling with Forth. Unlike the golfing tip says, it looks like n for .. next loop is the shortest for simple decreasing loops and n1 n0 do .. loop for increasing loops. The recursive call word recurse or recursive is way too verbose, and it still costs at least an if .. then.

Makonede · Accepted Answer · 2020-09-28 21:33:39Z

0

05AB1E, 16 bytes

₂F₂N-D<ð×?Aus£R,

Try it online!

₂F                # for N in [0, 1, 2, ..., 25]:
  ₂N-D<ð×?        # print 25 - N spaces with no trailing newline
          Aus£R,  # print the first 26 - N letters of the uppercase alphabet, reversed
                  # (implicit) exit for loop

answered Sep 28, 2020 at 21:33

Makonede

6,46518 silver badges49 bronze badges

Add a comment |

PkmnQ · Accepted Answer · 2020-09-29 13:48:28Z

0

Pyth, 21 bytes

=_r1GV26
+*\ -25NG=tG

Try it online!

Basically, it sets G to ZYXWVUTSRQPONMLKJIHGFEDCBA, and next prints space repeated some amount of times and G, then removes the first letter of G.

answered Sep 29, 2020 at 13:48

PkmnQ

2,6938 silver badges20 bronze badges

Add a comment |

Shaggy · Accepted Answer · 2020-09-29 14:36:18Z

0

Rockstar, 101 bytes

X's26
while X
O's""
let Y be X
while Y
cast Y+64 into L
let O be+L
let Y be-1

let X be-1
say " "*X+O

Try it here (Code will need to be pasted in)

answered Sep 29, 2020 at 14:36

Shaggy

41.6k4 gold badges34 silver badges92 bronze badges

Add a comment |

Axuary · Accepted Answer · 2021-05-02 00:19:28Z

0

Excel, 66 bytes

=LET(r,26-ROW(1:26),x,CONCAT(CHAR(65+r)),REPT(" ",r)&RIGHT(x,r+1))

Link to Spreadsheet

answered May 2, 2021 at 0:19

Axuary

3,4065 silver badges11 bronze badges

Add a comment |

emanresu A · Accepted Answer · 2021-05-02 01:10:16Z

0

Splinter, 253 bytes

Z{\A\
}H{\C\BZ}A{\M\L\K\JG{\I\HD}D{\G\F\E\DH}D}E{\V\U\TB{\S\R\Q\PF{\O\NA}F}B}S{\ }T{SS}U{TT}V{UU}W{VV}WVS\Z\Y\X\WEWV\Y\X\WESTUW\X\WETUW\WESUWEUW\U\TBSTW\TBTWBSW\R\Q\PFW\Q\PFSTUV\PFTUVFSUV\NAUVASTV\L\K\JGTV\K\JGSV\JGVGSTU\HDTUDSU\F\E\DHU\E\DHST\DHTHS\BZZ

Try it online!

Link is to a Python interpreter.

answered May 2, 2021 at 1:10

emanresu A

35.6k5 gold badges83 silver badges200 bronze badges

Add a comment |

SegFaultPlus4 · Accepted Answer · 2021-05-10 13:07:02Z

0

+100

Vyxal, 704 24 bytes

Try it online!

₄ʀƛ:ʁṘƛ65+C;ṅ$ð*$+;Ṙ

Behind door number 3, we have this answer - again just prints out the string (Edit 1: never mind, it doesn't)

edited May 10, 2021 at 13:07

answered May 10, 2021 at 10:45

SegFaultPlus4

1,1415 silver badges16 bronze badges

\$\begingroup\$ 23 bytes \$\endgroup\$
– emanresu A
May 10, 2021 at 11:26
\$\begingroup\$ outgolfed \$\endgroup\$
– lyxal
May 10, 2021 at 11:35
\$\begingroup\$ rip - might as well put the 23 byter \$\endgroup\$
– SegFaultPlus4
May 10, 2021 at 11:39
\$\begingroup\$ @Ausername the 23 byter prints everything in reverse. \$\endgroup\$
– SegFaultPlus4
May 10, 2021 at 11:51
\$\begingroup\$ Try it Online! For 20 \$\endgroup\$
– lyxal
May 10, 2021 at 12:48

Add a comment |

emanresu A · Accepted Answer · 2022-03-19 00:12:28Z

Pyramid Scheme, 1431 bytes

    ^         ^
   / \       / \
  /set\     /do \
 ^-----^   ^-----^
/a\   / \ /a\   /[\
---  /26 \---  ^---^
     -----    ^-   -^
             ^-     -^
            /]\      -^
           ^---^      -^
          ^-   -^      -^
         ^-     -^      -^
        ^-       -^      -^
       /[\       / \     /[\
      ^---^     /set\   ^---^
     ^-   -^   ^-----^  -^  -^
    ^-     -^ /c\   /a\ / \  -^
   / \     / \---   ---/set\  -^
  /set\   /do \       ^-----^  -^
 ^-----^ ^-----^     /a\   /-\  -^
/b\   /a\-^   /[\    ---  ^---^  -^
---   ---/b\ ^---^       /a\ /1\  -^
         ---/ \  -^      --- ---  /[\
           /set\  -^             ^---^
          ^-----^  -^           ^-  / \
         /b\   /+\ /?\         / \ /out\
         ---  ^---^---^       /do \-----^
             / \ /b\ / \     ^-----^    -^
            /-1 \---/out\   /c\   /[\   / \
            -----  ^-----   ---  ^---^ /chr\
                  / \           ^-  / \-----^
                 /chr\         ^-  /out\   / \
                ^-----        / \  -----^ /10 \
               / \           /set\     / \-----
              /32 \         ^-----^   /chr\
              -----        /c\   /-\  -----^
                           ---  ^---^     /+\
                               /c\ /1\   ^---^
                               --- ---  /c\ / \
                                        ---/65 \
                                           -----

Try it online!

Yes, I wrote this all by hand. It's kinda therapeutic...

Pignotto · Accepted Answer · 2023-10-18 06:31:07Z

0

C89, 96 bytes

i,j;main(){for(;i<26;)++j>25?puts("ZYXWVUTSRQPONMLKJIHGFEDCBA"+i),j=++i:putchar(' ');return 0;}

Try it online!

int i, j;

int main()
{
    while(i<26){
        extern int puts();
        extern int putchar();
        
        if (++j > 25) {     
            puts("ZYXWVUTSRQPONMLKJIHGFEDCBA" + i);
            j = ++i;
        }
        else { 
            putchar(' ');
        }
    }
    return 0;
}

answered Oct 18 at 6:31

Pignotto

1813 bronze badges

Add a comment |

Matthew Wilson · Accepted Answer · 2023-10-18 08:21:24Z

Uiua, 25 bytes

;⍥(-1&p⊂↯∶@ -1,⇌+@A⇡.).26

Try it online!

Explanation:

                       .26   # Put 26 onto the stack twice
 ⍥(                   )     # Repeat 26 times
                     .       # Copy the counter value
                    ⇡        # Make an array of natural numbers less than counter
                 +@A         # Add "A" to each element, getting ["A", "B",...]
                ⇌            # Reverse
             -1,             # Copy counter and subtract 1
         ↯∶@                 # Make an array of space chars
        ⊂                    # Join spaces with the letters
      &p                     # Print the result
    -1                       # Subtract 1 from the original counter
;                            # Pop the counter from the stack

Stack Exchange Network

Make an alphabet searchlight!

118 Answers 118

Rust, 87 bytes

With Spaces and Indentation

Emojicode, 156 bytes

SmileBASIC 3, 67 64 bytes

Swift, 118 bytes

Stax, 13 9 bytes

Unpacked (15 bytes) and explanation

T-SQL, 115 bytes

C# (.NET Core), 133 114 bytes

K4, 22 bytes

><>, 51 49 bytes

Dyalog APL, 34 23 21 bytes^SBCS

Gaia, 14 bytes

Ruby, 58 bytes

Japt `-R`, 15 12 11 bytes

Pip `-l`, 18 bytes

Explanation

Lua, 82 bytes

BRASCA, 23 bytes

Zsh, 41 bytes

Zsh, 36 bytes

Elixir, 84 bytes

Forth (gforth), 54 bytes

How it works

05AB1E, 16 bytes

Pyth, 21 bytes

Rockstar, 101 bytes

Excel, 66 bytes

Splinter, 253 bytes

Vyxal, 704 24 bytes

Pyramid Scheme, 1431 bytes

C89, 96 bytes

Uiua, 25 bytes

Your Answer

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

Linked

Hot Network Questions

Make an alphabet searchlight!

118 Answers 118

Rust, 87 bytes

With Spaces and Indentation

Emojicode, 156 bytes

SmileBASIC 3, 67 64 bytes

Swift, 118 bytes

Stax, 13 9 bytes

Unpacked (15 bytes) and explanation

T-SQL, 115 bytes

C# (.NET Core), 133 114 bytes

K4, 22 bytes

><>, 51 49 bytes

Dyalog APL, 34 23 21 bytesSBCS

Gaia, 14 bytes

Ruby, 58 bytes

Japt -R, 15 12 11 bytes

Pip -l, 18 bytes

Explanation

Lua, 82 bytes

BRASCA, 23 bytes

Zsh, 41 bytes

Zsh, 36 bytes

Elixir, 84 bytes

Forth (gforth), 54 bytes

How it works

05AB1E, 16 bytes

Pyth, 21 bytes

Rockstar, 101 bytes

Excel, 66 bytes

Splinter, 253 bytes

Vyxal, 704 24 bytes

Pyramid Scheme, 1431 bytes

C89, 96 bytes

Uiua, 25 bytes

Your Answer

Sign up or log in

Post as a guest

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

Linked

Related

Hot Network Questions

Dyalog APL, 34 23 21 bytes^SBCS

Japt `-R`, 15 12 11 bytes

Pip `-l`, 18 bytes

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