106
Vim, 25 23 bytes
:h<_↵jjYZZP25@='Ypx$p'↵
Where ↵ is the Return key.
:h<_↵ Open the help section v_b_<_example.
jjY Copy the "abcdefghijklmnopqrstuvwxyz" line.
ZZP Close this buffer and paste in ours.
25@=' '↵ Run these commands 25 times:
Yp ...
87
Charcoal, 2 bytes
↘β
Try it online!
How?
β - the lowercase alphabet
↘ - direction
Exactly the kind of challenge for which Charcoal was originally designed.
63
Excel, 19,604 bytes
=CHAR(64+MAX(COLUMN(),ROW()))
Paste this formula in A1, then drag all over A1:Z26.
Byte count:
The formula is 27 bytes.
You need to copy it 26^2 times. 27*26*26=19604.
I and others thought the score should be lower because you don't really need to type the formula again and again. I now think it's irrelevant - we count the size of the ...
57
Bash (+coreutils), 81, 87, 82, 78 bytes
Uses the man page for X, as the source of words.
Golfed
man xyst\ x|&grep -Po '\b[a-z]{4,} '|sed 's/\(.\)/\u\1 is for &/'|sort -uk1,1
EDITS
Used a non-existing 'xyst' man page + |& to save 5 bytes;
Saved 4 more bytes, by swapping sed and sort.
Test
%man xyst\ x|&grep -Po '\b[a-z]{4,} '|sed 's/\(.\)/...
41
Vim, 43 bytes
:h<_↵jjYZZPqqlmaYp`ajyl:norm v0r♥"↵`ajq25@q
Here ↵ represents Return (0x0a) and ♥ represents Ctrl-R (0x12).
Not quite as short as my Tabula Recta answer, but…
41
HTML (JavaScript (ES6)), 129 126 117 bytes
<input id=i onfocus=l=0,n=Date.now onkeypress=event.which-97-l?i.outerHTML='Fail':24<l?i.outerHTML=n()-t:t=l++?t:n()>
Click in the input and start typing! Also, my typing sucks; I take about 5 seconds even with practice. Edit: Saved 2 bytes thanks to @HermanLauenstein by switching language. Saved ...
39
Vim, 37 bytes
:h<_↵↵↵YZZPP$xqqxYpGP√2G$A♥-€k$q24@qJ
Legend
↵ = Return
√ = Ctrl+V
♥ = Ctrl+R
€ = Escape
37
C, 60 bytes
main(i){for(;i<703;)putchar(i++%27?65+(i/27+i%27%2)%26:10);}
37
6502 machine code (C64 PAL), 189 165 bytes
00 C0 A9 17 8D 18 D0 A9 40 85 FE E6 FE 20 E4 FF F0 FB 20 D2 FF C5 FE 38 D0 38
C9 5A 18 F0 33 C9 41 D0 E8 A9 00 85 FC 85 FD A9 18 85 FB A9 7F 8D 0D DD A9 7F
8D 18 03 A9 C0 8D 19 03 A9 D8 8D 04 DD A9 03 8D 05 DD A9 01 8D 0E DD A9 81 8D
0D DD D0 B9 A9 7F 8D 0D DD A9 47 8D 18 03 A9 FE AD 19 03 CE 0E DD B0 14 A9 0D
20 D2 ...
33
Python 2, 88 77 bytes
-11 bytes thanks to xnor (avoid the zip by traversing the string and counting c up from 65)
c=65
for x in'niooaauusoioaiuaaoiineeaei':print'%c is for %c%st'%(c,c,x);c+=1
Try it online!
(A port of my Jelly answer, when it was 56 bytes.)
A is for Ant
B is for Bit
C is for Cot
D is for Dot
E is for Eat
F is for Fat
G is for Gut
H is ...
32
Dyalog APL Extended, 4 bytes
⌽∘⍳¨
Try it online!
∘ the function composition of
⍳ iota - 'a'..input for alphabet chars, empty array for space
⌽ and after, reverse
¨ applied to each
31
Bash, 78, 69 bytes
Aardvarks, Babushkas and Kamikazes !
Golfed
sed -nr '/^[a-z]{9}$/s/(.)/\u\1 is for &/p'</u*/*/*/words|sort -uk1,1
EDITS
Got rid of grep, -9 bytes
Test
%sed -nr '/^[a-z]{9}$/s/(.)/\u\1 is for &/p'</u*/*/*/words|sort -uk1,1
A is for aardvarks
B is for babushkas
C is for cablecast
D is for dachshund
E is for eagerness
F is ...
30
05AB1E, 6 5 bytes
Thanks to Downgoat for saving 1 byte. Code:
ADv=À
Explanation:
A # Push the lowercase alphabet.
D # Duplicate it.
v # For each in the alphabet...
= # Print without popping and with a newline.
À # Rotate 1 to the left.
Uses the CP-1252 encoding. Try it online!.
30
Logo, 232 207 196 190 bytes
Did somebody say triangles?
Get out your compass and protractor, and let's do this the graphical way. The geometry uses an equilateral triangle to align the results. I previously had an isosceles triangle, but it involved too many decimal places. This change also compacted the output, reducing the amount of screen prep and font ...
28
Jelly, 6 bytes
ØA»'j⁷
Try it here. If only I hadn’t been lazy yesterday and implemented that one-byte alternative to j⁷ (join by newlines)…
ØA The uppercase alphabet.
»' Table of max(x, y).
j⁷ Join by newlines.
28
SageMath, 260 255 253 247 246 241 236 234 233 231 bytes
m=map
f=lambda w:sum(vector(m(w.count,m(chr,(65..90))))*(matrix(26,m([sum(ZZ([*m(ord,'v8^x$ 2??&:#Jd;2Nv&=4-wB/yY$4I"o^_bufTTZ fn"U(J1W:ZRYG=/p,ZTRn[RHJA$jbGn-ul2zeVJ')],92).digits(27)[:i])for i in(0..111)].count,(0..675)))+1)^100)
This constructs the transition matrix
[2 1 1 1 0 0 0 ...
27
Pyth, 10 bytes
h/#z[GrG1z
Test suite
We start by constructing a list with 3 elements: the lowercase alphabet, the uppercase alphabet, and the input. ([GrG1z) Then, we filter this list on the number of appearances of the input in the elements being nonzero. (/#z) Finally, we take the first element of the filtered list.
27
Python 2, 59 57 53 bytes
a=range(65,91)*27
a[::-27]=[10]*26
print bytearray(a)
Thanks to @xsot for -4 bytes!
27
Vim, 62, 60 keystrokes
:se ri|h<_<cr>jjYZZPqqx$pYpq26@qdjyH:g/^/m0<cr>VP:%norm DPA<C-v><C-r>"<C-v><esc>x<cr>
Drawing on inspiration from Lynn's awesome vim answer to take the idea of stealing the alphabet from the help docs.
You can watch it happen in real time as I struggle to remember the right sequence of ...
25
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, ...
23
TeaScript, 5 bytes
xN(0)
TeaScript has a (almost) built-in for this :D
Try it online (note: the online interpreter has been updated to TeaScript v3 so in which this is N0)
Try all the test cases
TeaScript 3, 2 bytes [non-competing]
Using TeaScript 3, this can become 2-bytes. This is non-competing because TeaScript 3 was made after this challenge
N0
1 ...
23
05AB1E, 11 6 bytes
Code:
Ç4+€¦J
Explanation:
First, we convert the string to their ASCII values. codegolf would become:
[99, 111, 100, 101, 103, 111, 108, 102]
To get to the indices of the alphabet, you subtract 96:
[3, 15, 4, 5, 7, 15, 12, 6]
To pad with zeros, add 100 to each element and remove the first character of each int. For the above example,...
22
R, 67 55 bytes
for(i in 26:1)cat(rep(" ",i-1),LETTERS[i:1],"
",sep="")
Try it online!
22
6502 machine code (C64), 113 bytes
00 C0 20 FD AE 20 9E AD 85 FB 20 A3 B6 A0 00 84 FC B1 22 99 6F C1 C9 41 90 14
C9 5B B0 04 E9 40 B0 0E C9 C1 90 08 C9 DB B0 04 E9 C0 B0 02 A9 00 99 6F C0 C5
FC 30 02 85 FC C8 C4 FB D0 D3 A9 00 99 6F C1 A0 C1 A9 6F 20 1E AB A9 0D 20 D2
FF A6 FC D0 01 60 C6 FC A0 00 B9 6F C1 F0 E6 BE 6F C0 D0 07 A9 20 99 6F C1 D0
05 CA 8A ...
21
Python 2, 36 bytes
i=1
exec'print chr(i+96)*i;i+=1;'*26
Try it online!
20
Рапира (Rapira), 172 142 bytes
ВЫВОД: "АаБбВвГгДдЕеЁёЖжЗзИиЙйКкЛлМмНнОоПпСсТтУуФфХхЦцЧчШшЩщЪъЫыЬьЭэЮюЯя"
Try it online!
Just for fun, given the challenge. It may not be golfed; I'm not really familiar with the language.
20
Microsoft Excel, 43 Bytes.
=COLUMN(INDIRECT(A1))&" "&ROW(INDIRECT(A1))
I couldn't help myself, I just had to use the right tool for the job.
Takes input on A1.
Test Cases
20
05AB1E, 7 bytes
Code:
₂žp.s1Λ
Uses the 05AB1E encoding. Try it online!
Explanation
žp.s # Get the suffixes of ZYX...CBA
Λ # Using the canvas mode, print the
₂ # first 26 elements of the array
1 # into the upper-right direction
19
Haskell, 58 bytes
f x=init x++reverse x
t=unlines$f[f['A'..c]|c<-['A'..'Z']]
Defines a function t that returns the output as a string.
f x= define a helper function
init x take the argument minus its last element
++ and concatenate it with
reverse x the argument reversed, producing ex. [a,b,c,b,a] from ...
18
///, 220 bytes
/|/\/\///n/WXY|m/JKL|l/PQRS|k/CDEF|j/ZaNfV|i/MbAeI|h/TUcO|g/GHdB|f/OlTU|e/BkGH|d/ImMbA|c/VnZaN|b/NfVnZ|a/AeImM/ab
ed
kg
DEFgC
EFgCD
FgCDE
gk
HdBkG
de
mi
KLiJ
LiJK
im
ba
fc
lh
QRShP
RShPQ
ShPQR
hl
UcOlT
cf
nj
XYjW
YjWX
jn
Try it online!
This was surprisingly non-trivial and I have no clue whether it's optimal.
The only way to golf a problem ...
Only top voted, non community-wiki answers of a minimum length are eligible
