Code Golf Stack Exchange is a question and answer site for programming puzzle enthusiasts and code golfers. It only takes a minute to sign up.
Sign up to join this community
Use any programming language to display "AWSALILAND" in such a way, so that each letter is in a new line and repeated as many times as its position in the English alphabet. For example letter, (A) should be displayed just once because it is the first letter of the alphabet. Letter D should be displayed 4 times because it is the 4th letter of the alphabet.
So, the output should be this:
A
WWWWWWWWWWWWWWWWWWWWWWW
SSSSSSSSSSSSSSSSSSS
A
LLLLLLLLLLLL
IIIIIIIII
LLLLLLLLLLLL
A
NNNNNNNNNNNNNN
DDDD
foreach(var s in"AWSALILAND")WriteLine(new string(s,s-64));
@Kevin Cruijssen Thanks, 2 bytes saved by removing { }
{})
\$\endgroup\$
Oct 17, 2018 at 12:44
is (this optimization seems to be almost always applicable to foreach loops) for 57 bytes. Try it online! (I guess being slightly late is okay?)
\$\endgroup\$
Apr 17, 2019 at 4:35
-1 byte from @Shaggy
`awÑ¢Ó€`u ¬®pIaZc
`awÑ¢Ó€`u ¬®pIaZc Full program
`awѢӀ` Compressed "awasiland"
u uppercase
¨ split and map each letter
p repeat the letter this many times:
a absolute difference of
Zc get charcode
I and 64
jm*d-Cd64"AWSALILAND
Try it online here.
jm*d-Cd64"AWSALILAND
"AWSALILAND String literal "AWSALILAND"
m Map each character of the above, as d, using:
Cd Get character code of d
- 64 Subtract 64
*d Repeat d that many times
j Join on newlines, implicit print
19 byte alternative, which outputs lower case: jm*dhxGd"awsaliland - link
+++++++[->++>>++>+>++>>+++>+++[<<<]<<]++++>>+>-->++>-->+>-->++>+[[->+>+<<]----[>+<----]>+>[-<.>]++++++++++.<,<<]
The actual word generation can probably be optimised further.
"AWSALILAND"|% t*y|%{"$_"*($_-64)}
Takes the string toCharArray, then multiplies each letter out the corresponding number of times. Implicit Write-Output gives us newlines for free.
Ho-hum.
for i in'AWSALILAND':print(i*(ord(i)-64))
for i in'AWSALILAND':print i*(ord(i)-64)
.•DθîRI§•ʒAyk>×u,
Explanation
.•DθîRI§• # push compressed string "awsaliland"
ʒ # filter
Ayk # get the index of the current letter in the alphabet
> # increment
× # repeat it that many times
u # upper-case
, # print
We only use filter here to save a byte over other loops due to ac implicit copy of the element on the stack. Filter works here since we print in the loop and don't care about the result of the filter.
êôM▄╬æ♠ª+ç█○==.
Explanation
`'YHu~{YX#`m64-_]* #Full program, unpacked,
`'YHu~{YX#` #Compressed "AWSALILAND"
m #Use the rest of the program as the block. Print each mapped element with a new-line.
64 #Put 64 on stack
- #Subtract current element by 64
_ #Get current index
] #Make a 1 element array
* #Duplicate that many times
Saved one byte by figuring out that the "*" command works with [arr int] and [int arr].
ＥAWSALILAND×ι⊕⌕αι
Try it online! Link is to verbose version of code. Explanation:
AWSALILAND Literal string
Ｅ Map over characters
ι Current character
α Uppercase alphabet
⌕ Find
⊕ Increment
ι Current character
× Repeat
Implicitly print each entry on its own line
R's clunky string handling characteristics on full display...
-3 thanks to @Giuseppe, who noticed it's actually shorter to convert a string from utf8 to int and back again than using R's native string splitting function...
write(strrep(intToUtf8(s<-utf8ToInt("AWSALILAND"),T),s-64),1)
match against LETTERS or utf8ToInt, so strtoi is a neat trick!
\$\endgroup\$
utf8ToInt is shorter! Try it online
\$\endgroup\$
"AWSALILAND"map(c=>s"$c"*(c-64)mkString)map println
for(c<-"AWSALILAND")println(s"$c"*(c-64))
A more elegant, tacit solution thanks to Adám!
(↑⎕A∘⍳⍴¨⊢)'AWSALILAND'
Initial solution:
↑a⍴¨⍨⎕A⍳a←'AWSALILAND'
⎕←. Btw, ↑⎕A∘⍳⍴¨⊢ is the generalised function — at no extra byte cost: (↑⎕A∘⍳⍴¨⊢)'AWSALILAND'
\$\endgroup\$
say work.
\$\endgroup\$
Oct 24, 2018 at 9:41
(32!r)#'r:"AWSALILAND"
r:"AWSALILAND" // set variable r to the string
(32!r) // mod 32 each string in r, the operation will use ASCII number
#' // for each value in the array, take that amount of the corresponding character in the string
v->"AWSALILAND".chars().forEach(c->System.out.println(((char)c+"").repeat(c-64)))
-1 byte thanks to @OlivierGrégoire.
Explanation:
v-> // Method with empty unused parameter and no return-type
"AWSALILAND".chars().forEach(c->
// Loop over the characters as integer unicode values
System.out.println( // Print with trailing newline:
((char)c+"") // The current character converted to char and then String
.repeat(c-64))) // repeated the unicode value minus 64 amount of times
chars().mapToObj(c->((char)c)+"").repeat(c-64).forEach(System.out::prinln) initially somewhere, but obviously it made it longer.. EDIT: Actually, I think I created a tip once about s.chars().forEach(c-> being shorter than a regular for(int c:s.getBytes()) once.. If only I would follow my own tips.. ;)
\$\endgroup\$
Oct 18, 2018 at 17:49
echo(#&>~_64+a.i.])'AWSALILAND'
echo(#&>~_64+a.i.])'AWSALILAND' - print
# ~ - copy (arguments reversed)
&> - each character (can be "0)
i. - the index of
] - the characters in
a. - the alphabet
_64+ - minus 64 (times)
S ='AWSALILAND'
L S LEN(1) . X REM . S :F(END)
&UCASE X @Y
OUTPUT =DUPL(X,Y) :(L)
END
'AWSALILAND'"@@64-Y"
'AWSALILAND' % Push this string
" % For each character in this string
@ % Push current character
@ % Push current character
64- % Implicitly convert to codepoint and subtract 64
Y" % Repeat that many times. Gives a string with the repeated character
% Implicit end
% Implicit display
SELECT REPLICATE(value,ASCII(value)-64)FROM STRING_SPLIT('A-W-S-A-L-I-L-A-N-D','-')
STRING_SPLIT is supported by SQL 2016 and later.
-l, 21 bytes_X A_-64M"AWSALILAND"
"AWSALILAND" Literal string
M to the characters of which we map this function:
A_ ASCII value of character
-64 minus 64 (= 1-based index in alphabet)
_X String-repeat character that many times
Autoprint, with each item on its own line (-l flag)
*s=L" AWSALILAND";main(i){for(;*++s;puts(""))for(i=*s-63;--i;printf(s));}
-18 bytes thanks to @ErikF
-5 bytes thanks to @ceilingcat
i=>[...'AWSALILAND'].map(c=>c.repeat(parseInt(c,36)-9)).join`
`
Explanation:
i=> // Prints the result of this function
[...'AWSALILAND'].map(c=> // Loop over the characters
c.repeat( // Repeat the current character
parseInt(c,36)-9))) // Character to alphabetical position
.join`
` // Prints a newline after every new char
Edit: -2 bytes thanks to @BrianH.
i=>[...'AWSALILAND'].map(c=>c.repeat(parseInt(c,36)-9)).join` ` (there's a literal newline in the join argument)
\$\endgroup\$
"AWSALILAND".unicodeScalars.forEach{print(String(repeating:String($0),count:Int($0.value)-64))}
How?
"AWSALILAND" // Starting string
.unicodeScalars // Convert into a list of unicode values
.forEach { // Loop over each number
print(String( // Create a string
repeating: String($0), // that repeats each character
count: Int($0.value) - 64)) // the unicode value minus 64 (the offset)
}
00000000: 2114 007e d640 477e ff10 fd23 3e0a ff7e !..~.@G~...#>..~
00000010: b720 f076 4157 5341 4c49 4c41 4e44 . .vAWSALILAND
Assembly:
ld hl,str ;load address of str
start:
ld a,(hl) ;get current char
sub 64 ;get letter num in alphabet
ld b,a ;store in b
ld a,(hl) ;get current char
print_char:
rst 38h ;print letter
djnz print_char ;repeat print loop b times
inc hl ;increment index of str, to get next char
ld a,10
rst 38h ;print newline
ld a,(hl) ;get current char
or a
jr nz, start ;if current char!=0, keep looping
end:
halt ;end program (if current char==0)
str:
db 'AWSALILAND'
for(i in s="AWSALILAND")console.log(s[i].repeat(s.charCodeAt(i)-64))
for loop to for...in, saving bytes on loop statement, removed increment, and removing statement to save the character.
for(i of"AWSALILAND")console.log(i.repeat(i.charCodeAt()-64))
\$\endgroup\$
Oct 13, 2022 at 4:38
AWSALILAND. \$\endgroup\$