Output the ŋarâþ crîþ alphabet song without using (m)any letters Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern) The PPCG Site design is on its way - help us make it awesome! Sandbox for Proposed ChallengesThe reversible reverserAlphanumeric balanceFinding prime numbers without using “prime characters”Output your username without using any of the characters in your username!Holy Hole In A Donut, Batman!Shoot the ASCII MoonAvoid repeating letters between five simple programsCreate an Alphabet SongThe Speed of LettersOutput your Score!
How discoverable are IPv6 addresses and AAAA names by potential attackers?
Why did the IBM 650 use bi-quinary?
How can I make names more distinctive without making them longer?
Why are there no cargo aircraft with "flying wing" design?
How much radiation do nuclear physics experiments expose researchers to nowadays?
What's the purpose of writing one's academic bio in 3rd person?
Can Pao de Queijo, and similar foods, be kosher for Passover?
Are variable time comparisons always a security risk in cryptography code?
How do I keep my slimes from escaping their pens?
How can whole tone melodies sound more interesting?
Is it true that "carbohydrates are of no use for the basal metabolic need"?
Why is "Captain Marvel" translated as male in Portugal?
How do I stop a creek from eroding my steep embankment?
Sorting numerically
Models of set theory where not every set can be linearly ordered
Did Kevin spill real chili?
How do I mention the quality of my school without bragging
Letter Boxed validator
Is above average number of years spent on PhD considered a red flag in future academia or industry positions?
I am not a queen, who am I?
How can players work together to take actions that are otherwise impossible?
Why don't the Weasley twins use magic outside of school if the Trace can only find the location of spells cast?
Do I really need recursive chmod to restrict access to a folder?
What do you call a plan that's an alternative plan in case your initial plan fails?
Output the ŋarâþ crîþ alphabet song without using (m)any letters
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)
The PPCG Site design is on its way - help us make it awesome!
Sandbox for Proposed ChallengesThe reversible reverserAlphanumeric balanceFinding prime numbers without using “prime characters”Output your username without using any of the characters in your username!Holy Hole In A Donut, Batman!Shoot the ASCII MoonAvoid repeating letters between five simple programsCreate an Alphabet SongThe Speed of LettersOutput your Score!
$begingroup$
Your goal is to write a program that takes no input and outputs the following text:
ca e na ŋa va o sa;
þa ša ra la ła.
ma a pa fa ga ta ča;
în ja i da ða.
ar ħo ên ôn ân uħo;
carþ taŋ neŋ es nem.
elo cenvos.
But there's a catch: for each letter (any character whose general category in Unicode starts with L) in your source, you get a penalty of 20 characters! (For reference, the text to be printed has 81 letters.)
The Perl 6 code below has 145 bytes and 84 letters, so it gets a score of 1,845:
say "ca e na ŋa va o sa;
þa ša ra la ła.
ma a pa fa ga ta ča;
în ja i da ða.
ar ħo ên ôn ân uħo;
carþ taŋ neŋ es nem.
elo cenvos."
The code below has 152 bytes and 70 letters, so it gets a score of 1,552:
$_="C e N ŋa V o S;
Þ Š R L Ł.
M a P F G T Č;
în J i D Ð.
ar ħo ên ôn ân uħo;
Crþ Tŋ neŋ es nem.
elo cenvos.";s:g/<:Lu>/$/.lc~'a'/;.say
Standard loopholes are forbidden.
Originally, I thought of forbidding letters altogether, but I don't think there are many languages that make this possible. You're more than welcome to try.
(ŋarâþ crîþ [ˈŋaɹa̰θ kɹḭθ] is one of my conlangs. I wanted to capitalise its name here, but I get the ugly big eng here. Oh well, the language doesn't use capital letters in its romanisation anyway.)
code-golf kolmogorov-complexity restricted-source
asked 3 hours ago
bb94bb94
1,127711
$endgroup$
add a comment |
$begingroup$
Your goal is to write a program that takes no input and outputs the following text:
ca e na ŋa va o sa;
þa ša ra la ła.
ma a pa fa ga ta ča;
în ja i da ða.
ar ħo ên ôn ân uħo;
carþ taŋ neŋ es nem.
elo cenvos.
But there's a catch: for each letter (any character whose general category in Unicode starts with L) in your source, you get a penalty of 20 characters! (For reference, the text to be printed has 81 letters.)
The Perl 6 code below has 145 bytes and 84 letters, so it gets a score of 1,845:
say "ca e na ŋa va o sa;
þa ša ra la ła.
ma a pa fa ga ta ča;
în ja i da ða.
ar ħo ên ôn ân uħo;
carþ taŋ neŋ es nem.
elo cenvos."
The code below has 152 bytes and 70 letters, so it gets a score of 1,552:
$_="C e N ŋa V o S;
Þ Š R L Ł.
M a P F G T Č;
în J i D Ð.
ar ħo ên ôn ân uħo;
Crþ Tŋ neŋ es nem.
elo cenvos.";s:g/<:Lu>/$/.lc~'a'/;.say
Standard loopholes are forbidden.
Originally, I thought of forbidding letters altogether, but I don't think there are many languages that make this possible. You're more than welcome to try.
(ŋarâþ crîþ [ˈŋaɹa̰θ kɹḭθ] is one of my conlangs. I wanted to capitalise its name here, but I get the ugly big eng here. Oh well, the language doesn't use capital letters in its romanisation anyway.)
code-golf kolmogorov-complexity restricted-source
asked 3 hours ago
bb94bb94
1,127711
$endgroup$
4
$begingroup$
kolmogorov-complexity, restricted-source, and special scoring are all sorts of things that benefit greatly from careful consideration in the sandbox. Currently, it seems like the best approach to this challenge would be to just write out all of the codepoints in decimal then turn them into text with a builtin, with some shortcut to encode all of theas--or not, depending on how many letters it would take, because 20 characters is a really big penalty (although when everything else is scored by bytes, it's not quite well defined...)!
$endgroup$
– Unrelated String
3 hours ago
$begingroup$
And considering the invocation of Unicode, some explicit rules governing special codepages as used by most golflangs are probably called for (alongside maybe a link to a script to validate scoring).
$endgroup$
– Unrelated String
2 hours ago
add a comment |
$begingroup$
Your goal is to write a program that takes no input and outputs the following text:
ca e na ŋa va o sa;
þa ša ra la ła.
ma a pa fa ga ta ča;
în ja i da ða.
ar ħo ên ôn ân uħo;
carþ taŋ neŋ es nem.
elo cenvos.
But there's a catch: for each letter (any character whose general category in Unicode starts with L) in your source, you get a penalty of 20 characters! (For reference, the text to be printed has 81 letters.)
The Perl 6 code below has 145 bytes and 84 letters, so it gets a score of 1,845:
say "ca e na ŋa va o sa;
þa ša ra la ła.
ma a pa fa ga ta ča;
în ja i da ða.
ar ħo ên ôn ân uħo;
carþ taŋ neŋ es nem.
elo cenvos."
The code below has 152 bytes and 70 letters, so it gets a score of 1,552:
$_="C e N ŋa V o S;
Þ Š R L Ł.
M a P F G T Č;
în J i D Ð.
ar ħo ên ôn ân uħo;
Crþ Tŋ neŋ es nem.
elo cenvos.";s:g/<:Lu>/$/.lc~'a'/;.say
Standard loopholes are forbidden.
Originally, I thought of forbidding letters altogether, but I don't think there are many languages that make this possible. You're more than welcome to try.
(ŋarâþ crîþ [ˈŋaɹa̰θ kɹḭθ] is one of my conlangs. I wanted to capitalise its name here, but I get the ugly big eng here. Oh well, the language doesn't use capital letters in its romanisation anyway.)
code-golf kolmogorov-complexity restricted-source
asked 3 hours ago
bb94bb94
1,127711
$endgroup$
Your goal is to write a program that takes no input and outputs the following text:
ca e na ŋa va o sa;
þa ša ra la ła.
ma a pa fa ga ta ča;
în ja i da ða.
ar ħo ên ôn ân uħo;
carþ taŋ neŋ es nem.
elo cenvos.
But there's a catch: for each letter (any character whose general category in Unicode starts with L) in your source, you get a penalty of 20 characters! (For reference, the text to be printed has 81 letters.)
The Perl 6 code below has 145 bytes and 84 letters, so it gets a score of 1,845:
say "ca e na ŋa va o sa;
þa ša ra la ła.
ma a pa fa ga ta ča;
în ja i da ða.
ar ħo ên ôn ân uħo;
carþ taŋ neŋ es nem.
elo cenvos."
The code below has 152 bytes and 70 letters, so it gets a score of 1,552:
$_="C e N ŋa V o S;
Þ Š R L Ł.
M a P F G T Č;
în J i D Ð.
ar ħo ên ôn ân uħo;
Crþ Tŋ neŋ es nem.
elo cenvos.";s:g/<:Lu>/$/.lc~'a'/;.say
Standard loopholes are forbidden.
Originally, I thought of forbidding letters altogether, but I don't think there are many languages that make this possible. You're more than welcome to try.
(ŋarâþ crîþ [ˈŋaɹa̰θ kɹḭθ] is one of my conlangs. I wanted to capitalise its name here, but I get the ugly big eng here. Oh well, the language doesn't use capital letters in its romanisation anyway.)
code-golf kolmogorov-complexity restricted-source
code-golf kolmogorov-complexity restricted-source
asked 3 hours ago
bb94bb94
1,127711
asked 3 hours ago
bb94bb94
1,127711
edited 3 hours ago
bb94
asked 3 hours ago
bb94bb94
1,127711
asked 3 hours ago
bb94bb94
1,127711
asked 3 hours ago
bb94bb94
1,127711
1,127711
4
$begingroup$
kolmogorov-complexity, restricted-source, and special scoring are all sorts of things that benefit greatly from careful consideration in the sandbox. Currently, it seems like the best approach to this challenge would be to just write out all of the codepoints in decimal then turn them into text with a builtin, with some shortcut to encode all of theas--or not, depending on how many letters it would take, because 20 characters is a really big penalty (although when everything else is scored by bytes, it's not quite well defined...)!
$endgroup$
– Unrelated String
3 hours ago
$begingroup$
And considering the invocation of Unicode, some explicit rules governing special codepages as used by most golflangs are probably called for (alongside maybe a link to a script to validate scoring).
$endgroup$
– Unrelated String
2 hours ago
add a comment |
4
$begingroup$
kolmogorov-complexity, restricted-source, and special scoring are all sorts of things that benefit greatly from careful consideration in the sandbox. Currently, it seems like the best approach to this challenge would be to just write out all of the codepoints in decimal then turn them into text with a builtin, with some shortcut to encode all of theas--or not, depending on how many letters it would take, because 20 characters is a really big penalty (although when everything else is scored by bytes, it's not quite well defined...)!
$endgroup$
– Unrelated String
3 hours ago
$begingroup$
And considering the invocation of Unicode, some explicit rules governing special codepages as used by most golflangs are probably called for (alongside maybe a link to a script to validate scoring).
$endgroup$
– Unrelated String
2 hours ago
4
4
$begingroup$
kolmogorov-complexity, restricted-source, and special scoring are all sorts of things that benefit greatly from careful consideration in the sandbox. Currently, it seems like the best approach to this challenge would be to just write out all of the codepoints in decimal then turn them into text with a builtin, with some shortcut to encode all of the
as--or not, depending on how many letters it would take, because 20 characters is a really big penalty (although when everything else is scored by bytes, it's not quite well defined...)!$endgroup$
– Unrelated String
3 hours ago
$begingroup$
kolmogorov-complexity, restricted-source, and special scoring are all sorts of things that benefit greatly from careful consideration in the sandbox. Currently, it seems like the best approach to this challenge would be to just write out all of the codepoints in decimal then turn them into text with a builtin, with some shortcut to encode all of the
as--or not, depending on how many letters it would take, because 20 characters is a really big penalty (although when everything else is scored by bytes, it's not quite well defined...)!$endgroup$
– Unrelated String
3 hours ago
$begingroup$
And considering the invocation of Unicode, some explicit rules governing special codepages as used by most golflangs are probably called for (alongside maybe a link to a script to validate scoring).
$endgroup$
– Unrelated String
2 hours ago
$begingroup$
And considering the invocation of Unicode, some explicit rules governing special codepages as used by most golflangs are probably called for (alongside maybe a link to a script to validate scoring).
$endgroup$
– Unrelated String
2 hours ago
add a comment |
7 Answers
7
active
oldest
votes
$begingroup$
PowerShell, scores 601 546
-join(67,65,0,69,0,78,65,0,299,65,0,86,65,0,79,0,83,65,27,-22,222,65,0,321,65,0,82,65,0,76,65,0,290,65,14,-22,77,65,0,65,0,80,65,0,70,65,0,71,65,0,84,65,0,237,65,27,-22,206,78,0,74,65,0,73,0,68,65,0,208,65,14,-22,65,82,0,263,79,0,202,78,0,212,78,0,194,78,0,85,263,79,27,-22,67,65,82,222,0,84,65,299,0,78,69,299,0,69,83,0,78,69,77,14,-22,69,76,79,0,67,69,78,86,79,83,14|%[char]($_+32))
Try it online!
Naive approach; I just took the code points and converted them to decimal, subtracted 32, then this code treats them as a char before -joining it back together into a single string.
answered 3 hours ago
AdmBorkBorkAdmBorkBork
28k468241
$endgroup$
add a comment |
$begingroup$
Haskell, 0 letters, 423 bytes = score 423
(['10'..]!!)<$>[89,87,22,91,22,100,87,22,321,87,22,108,87,22,101,22,105,87,49,0,244,87,22,343,87,22,104,87,22,98,87,22,312,87,36,0,99,87,22,87,22,102,87,22,92,87,22,93,87,22,106,87,22,259,87,49,0,228,100,22,96,87,22,95,22,90,87,22,230,87,36,0,87,104,22,285,101,22,224,100,22,234,100,22,216,100,22,107,285,101,49,0,89,87,104,244,22,106,87,321,22,100,91,321,22,91,105,22,100,91,99,36,0,91,98,101,22,89,91,100,108,101,105,36]
Try it online!
answered 2 hours ago
niminimi
32.7k32489
$endgroup$
add a comment |
$begingroup$
Jelly, 321 bytes + 2 letters = score 361
3343781777797791350694255572961968519437585132057650209974147122192542459108221624793330048943528237823681411832154316740173721249435700067706302064570847610741421342406380917446310820012503592770000532190167243585300911078873144513786923305473352724133578818457026824110152529235136461572588027747840738399150398304b354Ọ
Try it online!
This is hideous and someone can definitely do better.
Verify score.
answered 3 hours ago
HyperNeutrinoHyperNeutrino
19k437148
$endgroup$
add a comment |
$begingroup$
Jelly, 274 261 bytes + 2 letters = 314 301
98,8,7577,64,137+Ọ“24461267,1691524401827737“39“199183“2¤;108¤+“@36841915390646457101051137247389928597014417227222832154722739623607566349606250000571655631221597252888655305356086227145497408221809227156852666405895387397931203673256733239614440865652”;";/V
(Uses "+,/0123456789;@V¤Ọ“” of which V and Ọ are Unicode letters and are used once each)
Try it online!
answered 56 mins ago
Jonathan AllanJonathan Allan
54.4k537174
$endgroup$
add a comment |
$begingroup$
Python 3, 397 bytes + 19 letters = 777 score
print(''.join(chr(i+32)for i in[67,65,0,69,0,78,65,0,299,65,0,86,65,0,79,0,83,65,27,-22,222,65,0,321,65,0,82,65,0,76,65,0,290,65,14,-22,77,65,0,65,0,80,65,0,70,65,0,71,65,0,84,65,0,237,65,27,-22,206,78,0,74,65,0,73,0,68,65,0,208,65,14,-22,65,82,0,263,79,0,202,78,0,212,78,0,194,78,0,85,263,79,27,-22,67,65,82,222,0,84,65,299,0,78,69,299,0,69,83,0,78,69,77,14,-22,69,76,79,0,67,69,78,86,79,83,14]))
Try it online!
Port of AdmBorkBork's answer.
answered 3 hours ago
Artemis FowlArtemis Fowl
27111
$endgroup$
add a comment |
$begingroup$
Retina, 141 characters, 160 bytes, 15 letters = score 460
K`%# ' 1# !# 9# 2 6#;¶þ# š# 5# /# ł#.¶0# # 3# (# )# 7# č#;¶î1 ,# + &# ð#.¶#5 ħ2 ê1 ô1 â1 8ħ2;¶%#5þ 7#! 1'! '6 1'0.¶'/2 %'1926.
T`!--/-9`ŋ`-{
Try it online!
answered 1 hour ago
NeilNeil
82.8k745179
$endgroup$
add a comment |
$begingroup$
Jelly, 249 bytes (UTF-8) plus 2 letters; score = 289
“@@@ࣙ@@@[*ࢌ@࣯@@@࣐*@@@@@@࢛[*ࡼ@@@@ࡾ*@ࢵ@ࡸ@ࢂ@ࡰ@ࢵ[*ࢌ@ࣙ@ࣙ@@*@”O_>999×1902$$$_32Ọ
Try it online!
I couldn’t get this to work with TIO’s Jelly option, so the TIO link uses Python 3 to call Jelly. I think this is because of all the UTF-8 characters not in Jelly’s codepage.
Verify score!
answered 35 mins ago
Nick KennedyNick Kennedy
1,66649
$endgroup$
$begingroup$
So should this bePython 3 with jelly? (in which case the header & footer count).
$endgroup$
– Jonathan Allan
1 min ago
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "200"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f183248%2foutput-the-%25c5%258bar%25c3%25a2%25c3%25be-cr%25c3%25ae%25c3%25be-alphabet-song-without-using-many-letters%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
7 Answers
7
active
oldest
votes
7 Answers
7
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
PowerShell, scores 601 546
-join(67,65,0,69,0,78,65,0,299,65,0,86,65,0,79,0,83,65,27,-22,222,65,0,321,65,0,82,65,0,76,65,0,290,65,14,-22,77,65,0,65,0,80,65,0,70,65,0,71,65,0,84,65,0,237,65,27,-22,206,78,0,74,65,0,73,0,68,65,0,208,65,14,-22,65,82,0,263,79,0,202,78,0,212,78,0,194,78,0,85,263,79,27,-22,67,65,82,222,0,84,65,299,0,78,69,299,0,69,83,0,78,69,77,14,-22,69,76,79,0,67,69,78,86,79,83,14|%[char]($_+32))
Try it online!
Naive approach; I just took the code points and converted them to decimal, subtracted 32, then this code treats them as a char before -joining it back together into a single string.
answered 3 hours ago
AdmBorkBorkAdmBorkBork
28k468241
$endgroup$
add a comment |
$begingroup$
PowerShell, scores 601 546
-join(67,65,0,69,0,78,65,0,299,65,0,86,65,0,79,0,83,65,27,-22,222,65,0,321,65,0,82,65,0,76,65,0,290,65,14,-22,77,65,0,65,0,80,65,0,70,65,0,71,65,0,84,65,0,237,65,27,-22,206,78,0,74,65,0,73,0,68,65,0,208,65,14,-22,65,82,0,263,79,0,202,78,0,212,78,0,194,78,0,85,263,79,27,-22,67,65,82,222,0,84,65,299,0,78,69,299,0,69,83,0,78,69,77,14,-22,69,76,79,0,67,69,78,86,79,83,14|%[char]($_+32))
Try it online!
Naive approach; I just took the code points and converted them to decimal, subtracted 32, then this code treats them as a char before -joining it back together into a single string.
answered 3 hours ago
AdmBorkBorkAdmBorkBork
28k468241
$endgroup$
add a comment |
$begingroup$
PowerShell, scores 601 546
-join(67,65,0,69,0,78,65,0,299,65,0,86,65,0,79,0,83,65,27,-22,222,65,0,321,65,0,82,65,0,76,65,0,290,65,14,-22,77,65,0,65,0,80,65,0,70,65,0,71,65,0,84,65,0,237,65,27,-22,206,78,0,74,65,0,73,0,68,65,0,208,65,14,-22,65,82,0,263,79,0,202,78,0,212,78,0,194,78,0,85,263,79,27,-22,67,65,82,222,0,84,65,299,0,78,69,299,0,69,83,0,78,69,77,14,-22,69,76,79,0,67,69,78,86,79,83,14|%[char]($_+32))
Try it online!
Naive approach; I just took the code points and converted them to decimal, subtracted 32, then this code treats them as a char before -joining it back together into a single string.
answered 3 hours ago
AdmBorkBorkAdmBorkBork
28k468241
$endgroup$
PowerShell, scores 601 546
-join(67,65,0,69,0,78,65,0,299,65,0,86,65,0,79,0,83,65,27,-22,222,65,0,321,65,0,82,65,0,76,65,0,290,65,14,-22,77,65,0,65,0,80,65,0,70,65,0,71,65,0,84,65,0,237,65,27,-22,206,78,0,74,65,0,73,0,68,65,0,208,65,14,-22,65,82,0,263,79,0,202,78,0,212,78,0,194,78,0,85,263,79,27,-22,67,65,82,222,0,84,65,299,0,78,69,299,0,69,83,0,78,69,77,14,-22,69,76,79,0,67,69,78,86,79,83,14|%[char]($_+32))
Try it online!
Naive approach; I just took the code points and converted them to decimal, subtracted 32, then this code treats them as a char before -joining it back together into a single string.
answered 3 hours ago
AdmBorkBorkAdmBorkBork
28k468241
answered 3 hours ago
AdmBorkBorkAdmBorkBork
28k468241
answered 3 hours ago
AdmBorkBorkAdmBorkBork
28k468241
answered 3 hours ago
AdmBorkBorkAdmBorkBork
28k468241
28k468241
add a comment |
add a comment |
$begingroup$
Haskell, 0 letters, 423 bytes = score 423
(['10'..]!!)<$>[89,87,22,91,22,100,87,22,321,87,22,108,87,22,101,22,105,87,49,0,244,87,22,343,87,22,104,87,22,98,87,22,312,87,36,0,99,87,22,87,22,102,87,22,92,87,22,93,87,22,106,87,22,259,87,49,0,228,100,22,96,87,22,95,22,90,87,22,230,87,36,0,87,104,22,285,101,22,224,100,22,234,100,22,216,100,22,107,285,101,49,0,89,87,104,244,22,106,87,321,22,100,91,321,22,91,105,22,100,91,99,36,0,91,98,101,22,89,91,100,108,101,105,36]
Try it online!
answered 2 hours ago
niminimi
32.7k32489
$endgroup$
add a comment |
$begingroup$
Haskell, 0 letters, 423 bytes = score 423
(['10'..]!!)<$>[89,87,22,91,22,100,87,22,321,87,22,108,87,22,101,22,105,87,49,0,244,87,22,343,87,22,104,87,22,98,87,22,312,87,36,0,99,87,22,87,22,102,87,22,92,87,22,93,87,22,106,87,22,259,87,49,0,228,100,22,96,87,22,95,22,90,87,22,230,87,36,0,87,104,22,285,101,22,224,100,22,234,100,22,216,100,22,107,285,101,49,0,89,87,104,244,22,106,87,321,22,100,91,321,22,91,105,22,100,91,99,36,0,91,98,101,22,89,91,100,108,101,105,36]
Try it online!
answered 2 hours ago
niminimi
32.7k32489
$endgroup$
add a comment |
$begingroup$
Haskell, 0 letters, 423 bytes = score 423
(['10'..]!!)<$>[89,87,22,91,22,100,87,22,321,87,22,108,87,22,101,22,105,87,49,0,244,87,22,343,87,22,104,87,22,98,87,22,312,87,36,0,99,87,22,87,22,102,87,22,92,87,22,93,87,22,106,87,22,259,87,49,0,228,100,22,96,87,22,95,22,90,87,22,230,87,36,0,87,104,22,285,101,22,224,100,22,234,100,22,216,100,22,107,285,101,49,0,89,87,104,244,22,106,87,321,22,100,91,321,22,91,105,22,100,91,99,36,0,91,98,101,22,89,91,100,108,101,105,36]
Try it online!
answered 2 hours ago
niminimi
32.7k32489
$endgroup$
Haskell, 0 letters, 423 bytes = score 423
(['10'..]!!)<$>[89,87,22,91,22,100,87,22,321,87,22,108,87,22,101,22,105,87,49,0,244,87,22,343,87,22,104,87,22,98,87,22,312,87,36,0,99,87,22,87,22,102,87,22,92,87,22,93,87,22,106,87,22,259,87,49,0,228,100,22,96,87,22,95,22,90,87,22,230,87,36,0,87,104,22,285,101,22,224,100,22,234,100,22,216,100,22,107,285,101,49,0,89,87,104,244,22,106,87,321,22,100,91,321,22,91,105,22,100,91,99,36,0,91,98,101,22,89,91,100,108,101,105,36]
Try it online!
answered 2 hours ago
niminimi
32.7k32489
answered 2 hours ago
niminimi
32.7k32489
answered 2 hours ago
niminimi
32.7k32489
answered 2 hours ago
niminimi
32.7k32489
32.7k32489
add a comment |
add a comment |
$begingroup$
Jelly, 321 bytes + 2 letters = score 361
3343781777797791350694255572961968519437585132057650209974147122192542459108221624793330048943528237823681411832154316740173721249435700067706302064570847610741421342406380917446310820012503592770000532190167243585300911078873144513786923305473352724133578818457026824110152529235136461572588027747840738399150398304b354Ọ
Try it online!
This is hideous and someone can definitely do better.
Verify score.
answered 3 hours ago
HyperNeutrinoHyperNeutrino
19k437148
$endgroup$
add a comment |
$begingroup$
Jelly, 321 bytes + 2 letters = score 361
3343781777797791350694255572961968519437585132057650209974147122192542459108221624793330048943528237823681411832154316740173721249435700067706302064570847610741421342406380917446310820012503592770000532190167243585300911078873144513786923305473352724133578818457026824110152529235136461572588027747840738399150398304b354Ọ
Try it online!
This is hideous and someone can definitely do better.
Verify score.
answered 3 hours ago
HyperNeutrinoHyperNeutrino
19k437148
$endgroup$
add a comment |
$begingroup$
Jelly, 321 bytes + 2 letters = score 361
3343781777797791350694255572961968519437585132057650209974147122192542459108221624793330048943528237823681411832154316740173721249435700067706302064570847610741421342406380917446310820012503592770000532190167243585300911078873144513786923305473352724133578818457026824110152529235136461572588027747840738399150398304b354Ọ
Try it online!
This is hideous and someone can definitely do better.
Verify score.
answered 3 hours ago
HyperNeutrinoHyperNeutrino
19k437148
$endgroup$
Jelly, 321 bytes + 2 letters = score 361
3343781777797791350694255572961968519437585132057650209974147122192542459108221624793330048943528237823681411832154316740173721249435700067706302064570847610741421342406380917446310820012503592770000532190167243585300911078873144513786923305473352724133578818457026824110152529235136461572588027747840738399150398304b354Ọ
Try it online!
This is hideous and someone can definitely do better.
Verify score.
answered 3 hours ago
HyperNeutrinoHyperNeutrino
19k437148
answered 3 hours ago
HyperNeutrinoHyperNeutrino
19k437148
answered 3 hours ago
HyperNeutrinoHyperNeutrino
19k437148
answered 3 hours ago
HyperNeutrinoHyperNeutrino
19k437148
19k437148
add a comment |
add a comment |
$begingroup$
Jelly, 274 261 bytes + 2 letters = 314 301
98,8,7577,64,137+Ọ“24461267,1691524401827737“39“199183“2¤;108¤+“@36841915390646457101051137247389928597014417227222832154722739623607566349606250000571655631221597252888655305356086227145497408221809227156852666405895387397931203673256733239614440865652”;";/V
(Uses "+,/0123456789;@V¤Ọ“” of which V and Ọ are Unicode letters and are used once each)
Try it online!
answered 56 mins ago
Jonathan AllanJonathan Allan
54.4k537174
$endgroup$
add a comment |
$begingroup$
Jelly, 274 261 bytes + 2 letters = 314 301
98,8,7577,64,137+Ọ“24461267,1691524401827737“39“199183“2¤;108¤+“@36841915390646457101051137247389928597014417227222832154722739623607566349606250000571655631221597252888655305356086227145497408221809227156852666405895387397931203673256733239614440865652”;";/V
(Uses "+,/0123456789;@V¤Ọ“” of which V and Ọ are Unicode letters and are used once each)
Try it online!
answered 56 mins ago
Jonathan AllanJonathan Allan
54.4k537174
$endgroup$
add a comment |
$begingroup$
Jelly, 274 261 bytes + 2 letters = 314 301
98,8,7577,64,137+Ọ“24461267,1691524401827737“39“199183“2¤;108¤+“@36841915390646457101051137247389928597014417227222832154722739623607566349606250000571655631221597252888655305356086227145497408221809227156852666405895387397931203673256733239614440865652”;";/V
(Uses "+,/0123456789;@V¤Ọ“” of which V and Ọ are Unicode letters and are used once each)
Try it online!
answered 56 mins ago
Jonathan AllanJonathan Allan
54.4k537174
$endgroup$
Jelly, 274 261 bytes + 2 letters = 314 301
98,8,7577,64,137+Ọ“24461267,1691524401827737“39“199183“2¤;108¤+“@36841915390646457101051137247389928597014417227222832154722739623607566349606250000571655631221597252888655305356086227145497408221809227156852666405895387397931203673256733239614440865652”;";/V
(Uses "+,/0123456789;@V¤Ọ“” of which V and Ọ are Unicode letters and are used once each)
Try it online!
answered 56 mins ago
Jonathan AllanJonathan Allan
54.4k537174
edited 4 mins ago
answered 56 mins ago
Jonathan AllanJonathan Allan
54.4k537174
answered 56 mins ago
Jonathan AllanJonathan Allan
54.4k537174
answered 56 mins ago
Jonathan AllanJonathan Allan
54.4k537174
54.4k537174
add a comment |
add a comment |
$begingroup$
Python 3, 397 bytes + 19 letters = 777 score
print(''.join(chr(i+32)for i in[67,65,0,69,0,78,65,0,299,65,0,86,65,0,79,0,83,65,27,-22,222,65,0,321,65,0,82,65,0,76,65,0,290,65,14,-22,77,65,0,65,0,80,65,0,70,65,0,71,65,0,84,65,0,237,65,27,-22,206,78,0,74,65,0,73,0,68,65,0,208,65,14,-22,65,82,0,263,79,0,202,78,0,212,78,0,194,78,0,85,263,79,27,-22,67,65,82,222,0,84,65,299,0,78,69,299,0,69,83,0,78,69,77,14,-22,69,76,79,0,67,69,78,86,79,83,14]))
Try it online!
Port of AdmBorkBork's answer.
answered 3 hours ago
Artemis FowlArtemis Fowl
27111
$endgroup$
add a comment |
$begingroup$
Python 3, 397 bytes + 19 letters = 777 score
print(''.join(chr(i+32)for i in[67,65,0,69,0,78,65,0,299,65,0,86,65,0,79,0,83,65,27,-22,222,65,0,321,65,0,82,65,0,76,65,0,290,65,14,-22,77,65,0,65,0,80,65,0,70,65,0,71,65,0,84,65,0,237,65,27,-22,206,78,0,74,65,0,73,0,68,65,0,208,65,14,-22,65,82,0,263,79,0,202,78,0,212,78,0,194,78,0,85,263,79,27,-22,67,65,82,222,0,84,65,299,0,78,69,299,0,69,83,0,78,69,77,14,-22,69,76,79,0,67,69,78,86,79,83,14]))
Try it online!
Port of AdmBorkBork's answer.
answered 3 hours ago
Artemis FowlArtemis Fowl
27111
$endgroup$
add a comment |
$begingroup$
Python 3, 397 bytes + 19 letters = 777 score
print(''.join(chr(i+32)for i in[67,65,0,69,0,78,65,0,299,65,0,86,65,0,79,0,83,65,27,-22,222,65,0,321,65,0,82,65,0,76,65,0,290,65,14,-22,77,65,0,65,0,80,65,0,70,65,0,71,65,0,84,65,0,237,65,27,-22,206,78,0,74,65,0,73,0,68,65,0,208,65,14,-22,65,82,0,263,79,0,202,78,0,212,78,0,194,78,0,85,263,79,27,-22,67,65,82,222,0,84,65,299,0,78,69,299,0,69,83,0,78,69,77,14,-22,69,76,79,0,67,69,78,86,79,83,14]))
Try it online!
Port of AdmBorkBork's answer.
answered 3 hours ago
Artemis FowlArtemis Fowl
27111
$endgroup$
Python 3, 397 bytes + 19 letters = 777 score
print(''.join(chr(i+32)for i in[67,65,0,69,0,78,65,0,299,65,0,86,65,0,79,0,83,65,27,-22,222,65,0,321,65,0,82,65,0,76,65,0,290,65,14,-22,77,65,0,65,0,80,65,0,70,65,0,71,65,0,84,65,0,237,65,27,-22,206,78,0,74,65,0,73,0,68,65,0,208,65,14,-22,65,82,0,263,79,0,202,78,0,212,78,0,194,78,0,85,263,79,27,-22,67,65,82,222,0,84,65,299,0,78,69,299,0,69,83,0,78,69,77,14,-22,69,76,79,0,67,69,78,86,79,83,14]))
Try it online!
Port of AdmBorkBork's answer.
answered 3 hours ago
Artemis FowlArtemis Fowl
27111
edited 2 hours ago
answered 3 hours ago
Artemis FowlArtemis Fowl
27111
answered 3 hours ago
Artemis FowlArtemis Fowl
27111
answered 3 hours ago
Artemis FowlArtemis Fowl
27111
27111
add a comment |
add a comment |
$begingroup$
Retina, 141 characters, 160 bytes, 15 letters = score 460
K`%# ' 1# !# 9# 2 6#;¶þ# š# 5# /# ł#.¶0# # 3# (# )# 7# č#;¶î1 ,# + &# ð#.¶#5 ħ2 ê1 ô1 â1 8ħ2;¶%#5þ 7#! 1'! '6 1'0.¶'/2 %'1926.
T`!--/-9`ŋ`-{
Try it online!
answered 1 hour ago
NeilNeil
82.8k745179
$endgroup$
add a comment |
$begingroup$
Retina, 141 characters, 160 bytes, 15 letters = score 460
K`%# ' 1# !# 9# 2 6#;¶þ# š# 5# /# ł#.¶0# # 3# (# )# 7# č#;¶î1 ,# + &# ð#.¶#5 ħ2 ê1 ô1 â1 8ħ2;¶%#5þ 7#! 1'! '6 1'0.¶'/2 %'1926.
T`!--/-9`ŋ`-{
Try it online!
answered 1 hour ago
NeilNeil
82.8k745179
$endgroup$
add a comment |
$begingroup$
Retina, 141 characters, 160 bytes, 15 letters = score 460
K`%# ' 1# !# 9# 2 6#;¶þ# š# 5# /# ł#.¶0# # 3# (# )# 7# č#;¶î1 ,# + &# ð#.¶#5 ħ2 ê1 ô1 â1 8ħ2;¶%#5þ 7#! 1'! '6 1'0.¶'/2 %'1926.
T`!--/-9`ŋ`-{
Try it online!
answered 1 hour ago
NeilNeil
82.8k745179
$endgroup$
Retina, 141 characters, 160 bytes, 15 letters = score 460
K`%# ' 1# !# 9# 2 6#;¶þ# š# 5# /# ł#.¶0# # 3# (# )# 7# č#;¶î1 ,# + &# ð#.¶#5 ħ2 ê1 ô1 â1 8ħ2;¶%#5þ 7#! 1'! '6 1'0.¶'/2 %'1926.
T`!--/-9`ŋ`-{
Try it online!
answered 1 hour ago
NeilNeil
82.8k745179
answered 1 hour ago
NeilNeil
82.8k745179
answered 1 hour ago
NeilNeil
82.8k745179
answered 1 hour ago
NeilNeil
82.8k745179
82.8k745179
add a comment |
add a comment |
$begingroup$
Jelly, 249 bytes (UTF-8) plus 2 letters; score = 289
“@@@ࣙ@@@[*ࢌ@࣯@@@࣐*@@@@@@࢛[*ࡼ@@@@ࡾ*@ࢵ@ࡸ@ࢂ@ࡰ@ࢵ[*ࢌ@ࣙ@ࣙ@@*@”O_>999×1902$$$_32Ọ
Try it online!
I couldn’t get this to work with TIO’s Jelly option, so the TIO link uses Python 3 to call Jelly. I think this is because of all the UTF-8 characters not in Jelly’s codepage.
Verify score!
answered 35 mins ago
Nick KennedyNick Kennedy
1,66649
$endgroup$
$begingroup$
So should this bePython 3 with jelly? (in which case the header & footer count).
$endgroup$
– Jonathan Allan
1 min ago
add a comment |
$begingroup$
Jelly, 249 bytes (UTF-8) plus 2 letters; score = 289
“@@@ࣙ@@@[*ࢌ@࣯@@@࣐*@@@@@@࢛[*ࡼ@@@@ࡾ*@ࢵ@ࡸ@ࢂ@ࡰ@ࢵ[*ࢌ@ࣙ@ࣙ@@*@”O_>999×1902$$$_32Ọ
Try it online!
I couldn’t get this to work with TIO’s Jelly option, so the TIO link uses Python 3 to call Jelly. I think this is because of all the UTF-8 characters not in Jelly’s codepage.
Verify score!
answered 35 mins ago
Nick KennedyNick Kennedy
1,66649
$endgroup$
$begingroup$
So should this bePython 3 with jelly? (in which case the header & footer count).
$endgroup$
– Jonathan Allan
1 min ago
add a comment |
$begingroup$
Jelly, 249 bytes (UTF-8) plus 2 letters; score = 289
“@@@ࣙ@@@[*ࢌ@࣯@@@࣐*@@@@@@࢛[*ࡼ@@@@ࡾ*@ࢵ@ࡸ@ࢂ@ࡰ@ࢵ[*ࢌ@ࣙ@ࣙ@@*@”O_>999×1902$$$_32Ọ
Try it online!
I couldn’t get this to work with TIO’s Jelly option, so the TIO link uses Python 3 to call Jelly. I think this is because of all the UTF-8 characters not in Jelly’s codepage.
Verify score!
answered 35 mins ago
Nick KennedyNick Kennedy
1,66649
$endgroup$
Jelly, 249 bytes (UTF-8) plus 2 letters; score = 289
“@@@ࣙ@@@[*ࢌ@࣯@@@࣐*@@@@@@࢛[*ࡼ@@@@ࡾ*@ࢵ@ࡸ@ࢂ@ࡰ@ࢵ[*ࢌ@ࣙ@ࣙ@@*@”O_>999×1902$$$_32Ọ
Try it online!
I couldn’t get this to work with TIO’s Jelly option, so the TIO link uses Python 3 to call Jelly. I think this is because of all the UTF-8 characters not in Jelly’s codepage.
Verify score!
answered 35 mins ago
Nick KennedyNick Kennedy
1,66649
edited 17 mins ago
answered 35 mins ago
Nick KennedyNick Kennedy
1,66649
answered 35 mins ago
Nick KennedyNick Kennedy
1,66649
answered 35 mins ago
Nick KennedyNick Kennedy
1,66649
1,66649
$begingroup$
So should this bePython 3 with jelly? (in which case the header & footer count).
$endgroup$
– Jonathan Allan
1 min ago
add a comment |
$begingroup$
So should this bePython 3 with jelly? (in which case the header & footer count).
$endgroup$
– Jonathan Allan
1 min ago
$begingroup$
So should this be
Python 3 with jelly? (in which case the header & footer count).$endgroup$
– Jonathan Allan
1 min ago
$begingroup$
So should this be
Python 3 with jelly? (in which case the header & footer count).$endgroup$
– Jonathan Allan
1 min ago
add a comment |
If this is an answer to a challenge…
…Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.
…Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.
Explanations of your answer make it more interesting to read and are very much encouraged.…Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.
More generally…
…Please make sure to answer the question and provide sufficient detail.
…Avoid asking for help, clarification or responding to other answers (use comments instead).
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f183248%2foutput-the-%25c5%258bar%25c3%25a2%25c3%25be-cr%25c3%25ae%25c3%25be-alphabet-song-without-using-many-letters%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
4
$begingroup$
kolmogorov-complexity, restricted-source, and special scoring are all sorts of things that benefit greatly from careful consideration in the sandbox. Currently, it seems like the best approach to this challenge would be to just write out all of the codepoints in decimal then turn them into text with a builtin, with some shortcut to encode all of the
as--or not, depending on how many letters it would take, because 20 characters is a really big penalty (although when everything else is scored by bytes, it's not quite well defined...)!$endgroup$
– Unrelated String
3 hours ago
$begingroup$
And considering the invocation of Unicode, some explicit rules governing special codepages as used by most golflangs are probably called for (alongside maybe a link to a script to validate scoring).
$endgroup$
– Unrelated String
2 hours ago