-1
\$\begingroup\$

You need to print A-Z like this:

1. A
2. B
3. C
4. D
5. E
6. F
7. G
8. H
9. I
10. J
11. K
12. L
13. M
14. N
15. O
16. P
17. Q
18. R
19. S
20. T
21. U
22. V
23. W
24. X
25. Y
26. Z

But your source code cannot use 1,2,4,6.

Trailing newlines in output allowed,, but leading ones not allowed.

Standard loopholes apply, shortest code wins.

\$\endgroup\$
2
  • 12
    \$\begingroup\$ This is pretty much a duplicate of many existing restricted-source kolmogorov-complexity "print X without Y" challenges, and the ban on 1 2 4 and 6 is arbitrary and unchallenging, \$\endgroup\$
    – pxeger
    Feb 28 '21 at 11:09
  • 10
    \$\begingroup\$ In future, please use the Sandbox to get feedback on your question before posting. \$\endgroup\$
    – pxeger
    Feb 28 '21 at 11:09

31 Answers 31

1
2
0
\$\begingroup\$

APL (Dyalog Unicode), 27 bytes

⎕∘←¨⎕a,⍨¨{'. ',⍨⍕⍵}¨⍳⎕a⍳'Z'

Try it online!

\$\endgroup\$
1
2

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy