Given a number, program must return the alphabet letter correspondent.
1 is A, 2 is B, 3 is C and so it goes...(Full program)
⎕⌷⎕A
Explanation:
⎕ (user input) ⌷ (index) ⎕A (alphabet)
(They're supposed to be boxes, it's not an encoding problem.)
>,----------[>++++++[-<------>],----------]<[<]>>[<--[->++++++++++<]>>]+++++++[-<+++++++++>]<-.>++++++++++.
Thanks to Dorian for saving 3 bytes and inspiring 3 more
,>,[<+[-<+>[-<]>>]<[<++<-]>++>>]<<+++[->+++++<]>+.
,>, Gets input
[ if a two digit number
<+[-<+>[-<]>>] Gets modulo 2 of first number plus 1
<[<++<-] Sets the fives cell to 2 if the first number is a 2
>++ Adds another 2 to the fives cell
>>] Moves to cell after ones cell
<<+++ Adds 3 to fives cell
[->+++++<] Multiply the fives cell by 5 and add it to the ones cell
>+. Add one and print
,>,[<[-<+>[-<]>>]>[>++>]<++[-<+++++>]]++++[-<++++>]<.
\$\endgroup\$
,>,[<[-<+>[-<]>>]<<<[->+<]>+>>]<<+++[->+++++<]>+.
\$\endgroup\$
Full program including input and output.
?64+af
save to file and run with $ dc file
dc -f file
\$\endgroup\$
LETTERS[x]
Usage:
LETTERS[21]
[1] "U"
"&++,@
Takes advantage of the extra spaces at the end of a wrapping string literal by adding two spaces (32*2 = 64) to the inputted number to turn it into the corresponding alphabetic character. Funnily enough, if we use a implementation that doesn’t include the wrapping spaces, we can do "&+.@ to add the @ (64) to the number instead.
a.{~64+
Usage:
a.{~64+1
A
sub("ABCDEFGHIJKLMNOPQRSTUVWXYZ",Ans,1
This is as short as it gets...
<?=chr(64+$argn);
Run s pipe with -F
c+64
Boring, but probably optimal. Adds 64 to the given number and converts it to ASCII. !¡→'A is cuter (awww, the exclamation marks are friends!) but one byte longer.
@Gt
Saved two bytes thanks to ovs
Completely forgot about t and implicit Q
Explanation:
@ Index
G in alphabet of
t one less than
Q Input (implicitly added to solve arity)
t and implicit Q
\$\endgroup\$
Nov 28, 2017 at 16:27
chr(($ARGV[0] + 64))
Verification :
risk@skynet:~/perl$ for x in {1..26}; do perl ./ord.pl $x; done;
ABCDEFGHIJKLMNOPQRSTUVWXYZrisk@skynet:~/perl$
A({/'+;?/@
Expanded:
A ( {
/ ' + ;
? / @ . .
. . . .
. . .
This honestly took me way longer than it should have, as it's just 2 simple reflections.
A ( {
. . . .
? ' + ; @
. . . .
. . .
('@'..'Z')[$args]
-1 byte thanks to @mazzy lolI don't think it'll get much shorter than this.
[char](64+"$args")
Takes input from a command line argument.
64+c
Because, why not. Takes input implicitly, pushes 64 and adds it to the input number. Finally it converts the number to its ASCII-equivalent using c.
As partially applied composition:
10h$64+
(x+64).chr
Reading from STDIN and printing to STDOUT:
$><<(gets.to_i+64).chr
Assuming the number is already on the stack:
64.+L[(see here in action.).
Does the usual: Add 64, convert to character based on ASCII value.
If number is supplied as a string via stdin to stdout (10 characters):
ri64.+L[sh
Alternative version without using ASCII value conversion:
'@'Zr@\/!!
String.fromCharCode(66-x);
echo chr(66-$argv[0])
64+]''+
64 # corresponds to '@' in ASCII (65 is 'A')
+] # add the input to 64. ']' is used for ASCII.
''+ # the conversion process
[.
\$\endgroup\$
Sep 18, 2012 at 12:14
<%=Chr(c+64)%>
Expects c to hold the character number.
program must return -> I see no program, I don't see c being initialized, I don't see anything returned/printed.
\$\endgroup\$
c come from? You'd need something like request.form("c") or something (and the inevitable cast to int/long etc.).
\$\endgroup\$
C# 4,50KB (196 characters)
My first time here =)
using System; namespace W { class P { static void Main(string[] args) {
Console.WriteLine(" abcdefghijklmnopqrstuvwxyz".ToCharArray()[int.Parse(Console.ReadLine())]);
}
}
}
s after the " ",s. You could split the string " abcdefghijklmnopqrstuvwxyz"`. Also, rather than compile a list beforehand, it is much more efficient to choose the characters based off of ascii values.
\$\endgroup\$
The program; this is not a complete program but (part of) a function. Other than that: drop the array/lookup! Ever heard of the ASCII table? ;-) And dont forget that, if you insist on a "lookup table", a string is an array of chars: string a=" abcdefghijklmnopqrstuvwxyz"; shortens your code massively.
\$\endgroup\$
args for input instead of Console.readline, shorten args to a and drop the using System and just write System.Console.WriteLine. The .ToCharArray() is also not required (a string is a char-array implicitly). Finally, the WriteLine can be shortened to Write since the challenge doesn't specify that the program needs to output a newline.
\$\endgroup\$
class P{static void Main(string[] a){System.Console.WriteLine(" abcdefghijklmnopqrstuvwxyz"[int.Parse(a[0])]);}}. The only thing left to do to "optimize" this code further is to drop the alphabet string and just use ASCII as I did in my entry which will get you down to 88 :-)
\$\endgroup\$
using System;namespace W{class P{static void Main(string[] args){Console.WriteLine(" abcdefghijklmnopqrstuvwxyz".ToCharArray()[int.Parse(Console.ReadLine())]);}}}.
\$\endgroup\$
class P{static void Main(string[]a){System.Console.Write((char)(int.Parse(a[0])+64));}}
Complete program (not some (part of a) "function" expecting foo to be bar to work), accepts command line parameter: foo.exe 1 prints A, foo.exe 16 prints P
When I make the same assumptions as, for example, the 'code-golfers' that posted the VSCript Classic ASP, Python, Burlesque, Ruby, C solutions we can get it down to 10:
(char)x+64
"Assuming x is magically initialized / passed in / on the stack / whatever excuse" and the contest doesn't explicitly require me to print it, just "return" it (which most of the above solutions don't do, either).
chr(64+x)
print chr(64+input())
BrainFuck, 66
,>,----------[<[->++++++++++<]++++++[>+++++++<-]>>]++++[<++++>-]<.
INPUT N?CHR$(N+64)
