•3[ÜAʒg‰ŽÎ<\¦•6¡εS"-.@(=_"sèJ∞}'\∞5LRׂ˜.C
Try it online!
1026344463000063444446355555 is now the Icecream Number b/c nobody else has used it.
Full program: •3[ÜAʒg‰ŽÎ<\¦•6¡εS"-.@(=_"sèJ∞}'\∞5LRׂ˜.C
current >> • || stack: []
current >> 6 || stack: [1026344463000063444446355555]
current >> ¡ || stack: [1026344463000063444446355555, '6']
current >> ε || stack: [['102', '3444', '30000', '344444', '355555']]
For each: S"-.@(=_"sèJ∞
Full program: S"-.@(=_"sèJ∞
current >> S || stack: ['102']
current >> " || stack: [['1', '0', '2']]
current >> s || stack: [['1', '0', '2'], '-.@(=_']
current >> è || stack: ['-.@(=_', ['1', '0', '2']]
current >> J || stack: [['.', '-', '@']]
current >> ∞ || stack: ['.-@']
stack > ['.-@@-.']
Full program: S"-.@(=_"sèJ∞
current >> S || stack: ['3444']
current >> " || stack: [['3', '4', '4', '4']]
current >> s || stack: [['3', '4', '4', '4'], '-.@(=_']
current >> è || stack: ['-.@(=_', ['3', '4', '4', '4']]
current >> J || stack: [['(', '=', '=', '=']]
current >> ∞ || stack: ['(===']
stack > ['(======)']
Full program: S"-.@(=_"sèJ∞
current >> S || stack: ['30000']
current >> " || stack: [['3', '0', '0', '0', '0']]
current >> s || stack: [['3', '0', '0', '0', '0'], '-.@(=_']
current >> è || stack: ['-.@(=_', ['3', '0', '0', '0', '0']]
current >> J || stack: [['(', '-', '-', '-', '-']]
current >> ∞ || stack: ['(----']
stack > ['(--------)']
Full program: S"-.@(=_"sèJ∞
current >> S || stack: ['344444']
current >> " || stack: [['3', '4', '4', '4', '4', '4']]
current >> s || stack: [['3', '4', '4', '4', '4', '4'], '-.@(=_']
current >> è || stack: ['-.@(=_', ['3', '4', '4', '4', '4', '4']]
current >> J || stack: [['(', '=', '=', '=', '=', '=']]
current >> ∞ || stack: ['(=====']
stack > ['(==========)']
Full program: S"-.@(=_"sèJ∞
current >> S || stack: ['355555']
current >> " || stack: [['3', '5', '5', '5', '5', '5']]
current >> s || stack: [['3', '5', '5', '5', '5', '5'], '-.@(=_']
current >> è || stack: ['-.@(=_', ['3', '5', '5', '5', '5', '5']]
current >> J || stack: [['(', '_', '_', '_', '_', '_']]
current >> ∞ || stack: ['(_____']
stack > ['(__________)']
current >> ' || stack: [['.-@@-.', '(======)', '(--------)', '(==========)', '(__________)']]
current >> ∞ || stack: [['.-@@-.', '(======)', '(--------)', '(==========)', '(__________)'], '\\']
current >> 5 || stack: [['.-@@-.', '(======)', '(--------)', '(==========)', '(__________)'], '\\/']
current >> L || stack: [['.-@@-.', '(======)', '(--------)', '(==========)', '(__________)'], '\\/', '5']
current >> R || stack: [['.-@@-.', '(======)', '(--------)', '(==========)', '(__________)'], '\\/', [1, 2, 3, 4, 5]]
current >> × || stack: [['.-@@-.', '(======)', '(--------)', '(==========)', '(__________)'], '\\/', [5, 4, 3, 2, 1]]
current >> ‚ || stack: [['.-@@-.', '(======)', '(--------)', '(==========)', '(__________)'], ['\\/\\/\\/\\/\\/', '\\/\\/\\/\\/', '\\/\\/\\/', '\\/\\/', '\\/']]
current >> ˜ || stack: [[['.-@@-.', '(======)', '(--------)', '(==========)', '(__________)'], ['\\/\\/\\/\\/\\/', '\\/\\/\\/\\/', '\\/\\/\\/', '\\/\\/', '\\/']]]
current >> . || stack: [['.-@@-.', '(======)', '(--------)', '(==========)', '(__________)', '\\/\\/\\/\\/\\/', '\\/\\/\\/\\/', '\\/\\/\\/', '\\/\\/', '\\/']]
.-@@-.
(======)
(--------)
(==========)
(__________)
\/\/\/\/\/
\/\/\/\/
\/\/\/
\/\/
\/
stack > [' .-@@-.\n (======)\n (--------)\n(==========)\n(__________)\n \\/\\/\\/\\/\\/\n \\/\\/\\/\\/\n \\/\\/\\/\n \\/\\/\n \\/']
•3[ÜAʒg‰ŽÎ<\¦• | Pushes 1026344463000063444446355555 to the stack.
-----------------------------+-------------------------------------------------
6¡ | Split on 6's.
-----------------------------+-------------------------------------------------
ε } | Loop on each piece to create the top of the icecream...
S | Split into single chars.
"-.@(=_"sè | Substitute in the correct symbol for each number.
J∞ | Join, then mirror.
-----------------------------+-------------------------------------------------
'\∞ | Push \/.
5LR | Push [5,4,3,2,1]
× | Multiply '\/' by each 5,4,3,2 and 1.
‚˜ | Join top to bottom.
.C | Center w/ newlines.
This seems like a strange challenge, wouldn't simply executing that as a string literal technically be a solution for some interpreted languages like JS/Python? – Jacob Persi – 2017-11-17T19:26:15.447
2@JacobPersi This is a classic [tag:kolmogorov-complexity] challenge, where the aim is to compress the given string as much as possible, hardcoding is probably not too golfy – Mr. Xcoder – 2017-11-17T19:29:11.027
Lol - my preferred 'C' family languages again have 0 chance at this. – Michael Dorgan – 2017-11-17T19:30:16.123
@dzaima yes trailing spaces and trailing new lines are fine. – cleblanc – 2017-11-17T19:43:07.797
@MichaelDorgan 146 bytes
f(){puts(" .-@@-.\n (======)\n (--------)\n(==========)\n(__________)\n \\/\\/\\/\\/\\/\n \\/\\/\\/\\/\n \\/\\/\\/\n \\/\\/\n \\/");}
– cleblanc – 2017-11-17T19:43:59.587Sure - could printf() or whatever. But, strings and C won't ever compete :) Should have stated "chance at winning this." My bad – Michael Dorgan – 2017-11-17T19:46:49.703
@MichaelDorgan I'm curious if there's a golfing language with an icecream-cone build-in – cleblanc – 2017-11-17T20:00:13.140
@cleblanc Which prints this exact text? Really, really unlikely. – Erik the Outgolfer – 2017-11-17T20:06:42.800
I'd say that some of these languages feel like they were invented for code golf. I could probably create
iCeCrEaMCoNe
that one character prints a cone and win. – Michael Dorgan – 2017-11-17T21:37:50.8006@MichaelDorgan many of the languages were invented for code golf, but that shouldn't discourage you from answering in production languages - here it's suggested to upvote interesting answers, and an answer in
iCeCrEaMCoNe
would not be one of those. This site even used to have a rule that you can't answer in a language( / use a feature) newer than the challenge, but that got replaced by "don't upvote trivial answers". After all, these golfing languages exist just for fun :) – dzaima – 2017-11-17T22:24:13.7673Understood. I answered one recently in Arm Assembler. Obviously not going to win, but fun none the less :) – Michael Dorgan – 2017-11-17T23:51:39.013
@dzaima I missed some memos while I was gone, apparently. That rule got replaced? Do you have a link to the meta post? I'd love to read through it. – Steven H. – 2017-11-20T18:49:33.773
1
@StevenH. Here's the meta post - it's somewhat old, but many still haven't seen it
– dzaima – 2017-11-20T18:52:11.000@dzaima Isn't using a language/feature that was created specifically for the challenge still considered a standard loophole? – KSmarts – 2017-11-28T14:51:37.850
@KSmarts I don't think it is (or should be), it's more like an implicit loophole. I have once made (a version of) one of my answers non-competing because I felt like a thing I added (that was mostly documentated) was too built-in-y for the challenge, though that built-in could very well be useful on other challenges. – dzaima – 2017-11-28T14:59:58.253