Alphabetize Integers
code-golf sorting
For a given set of numbers, put them in alphabetical order when they are spelled out. For example, 1, 2, 3, 4, 5 would output to 5, 4, 1, 3, 2 (five, four, one, three, two). Your code should accept any number of integers of maximum length six. It should al...
I hate it when I ask a question on SO/SE and the first thing that happens is a downvote.
no comment. no chance for an answer. just relegated to oblivion, immediately.
@MartinEnder I've been enjoying Shenzhen I/O but I'm somewhat annoyed that the high score tables don't reflect whether or not you've come back to the puzzle after getting access to new components.
I spent a few hours trying to reach a particular high score before giving up, then later discovered that I needed to advance a few levels, unlock a new component, then come back to it.
If I didn't specify how ties would be broken in a code-golf challenge, and a tie occurs, is the normal consensus to select the person who posted first, or who reached the lowest byte-count first (the person who posted first was behind until recently, and I had already given the accepted answer to the other, more recent post for having the smallest byte count first).
@betseg shenzhen and TIS-100 are both games about writing very short assembly-like programs that interact with each other through narrow data channels. in TIS-100, there's a static arrangement of microcontrollers and channels, but some of them get disabled and you have to work around the limits on the shape of the network. in shenzhen you get to build the network however you want, with more choice of components.
anyway, I very rarely do this, but getting that initial downvote into oblivion means I won't get any answers otherwise... I'd appreciate an upvote or two here: stackoverflow.com/questions/40882704/…
I enjoyed spacechem a lot more than TIS-100. Probably because "small assembly language puzzle" is something I've already got plenty of, but the puzzles in space chem are unique, and the story aspects in space chem with unusual levels also add something.
and (from what I've seen so far in shenzhen) the problems are a bit more "basic standard programming puzzles" whereas the shenzhen puzzles so far seem a bit arbitrary most of the time
@TuxCopter the key difference in my mind is that in TIS-100, a puzzle includes being forced to have the nodes connected in a certain configuration, with chains of nodes of a certain length, and specific numbers of connections. but in shenzhen, choosing and laying out the components is up to you.
the +- thing is close to how conditional orders worked in a strategy game I played many years ago. My favorite game ever, actually, and I'm sad it died.
Overlord PBEM, based on Lorenai, based on Atlantis. long term slow-motion open world many-players turn based strategy games with textual play-by-email interfaces.
@Sparr the continuousness of SpaceChem (and Codex) freaks me out for some reason. It's definitely an interesting twist on the usual kind of discrete programming problems, but it somehow annoys me that it gets in the way of reasoning about the program behaviour before actually trying out what fits and what doesn't.
That is distinct from dealing with "traditional" 2d programming languages, in that spacechem has you dragging around things that are more than one tile large?
N children, with no two sharing their exact size, are lined up in some order. Each can only compare heights with their immediate neighbours. When the teacher shouts "raise hands if you are the tallest", they do so if they are taller than both their neighbours, and they do so simultaneously. If on...
not necessarily that. the problem is the continuous movement of rotation of the things that are more than one tile large. in traditional 2D languages, everything moves one cell (or several cells) per tick. there is no continuous collision detection.
a "traditional" 2d language with "things that more than one tile large" sounds like a fun idea though :)
@Lembik gray code with the mentioned skips follows the pattern gs n k = gs (n-1) k ++ map (+2^(k-1)) (reverse $ gs (n-1) (k-1)). The first part has the base case gs n n which of course has only 1-bit changes. The second part has a base case of gs m 0, which doesn't have any elements in it. The items in the middle of the lists have both at most 1 bit, so to change between them takes at most 2 bits.
@MartinEnder 'a "traditional" 2d language with "things that more than one tile large" sounds like a fun idea though'... marbelous with tetris pieces instead of marbles :)
but yeah, so far I've started SpaceChem twice and never got beyond the first two or three level sets. I really like the game, but somehow I find it a lot harder to motivate myself to pull through than for other programming games.
yeah that's true. I really liked competing with Sp3000 on TIS and HRM. That was a lot more fun than the global scores on SpaceChem back when I played it.
also I kinda should finish Infinifactory at some point. I am in what I think is the last level set, but the tediousness curve of that just skyrocketed compared to previous levels.
A Numpad's Knight Numbers Extended Edition
This challenge is an extension of the one linked above by Calvin, and inspired by a comment by Darrel Hoffman.
My computer has a numpad which is significantly more expansive than Calvin's. For reference, it looks like this:
🔒/ * -
7 8 9 +
4 5 6 +
1 2...
You don't need to set the buffer at all. It should be a buffered call to fread, mallocing along the way. If the buffer is still false after the read loop, it serves as a nice error check, too.
Year of 2010, an Icelandic Vulcano, concisely named Eyjafjallajökull erupted, resulting in my long-planned flight being canceled.
In case this ever happens again, I would really like to know in advance, so please help me build a simple visual alert system !
Input
Take the Icelandic Meteorolog...
You need to produce output that is non-deterministic.
In this case, this will be defined to mean that the output cannot be known to be a specific result.
Rules:
A pseudo-random number generator that always has the same seed does not count.
You can rely on the program being run at a different ...
I made my last project unix-centric and deleted all the MinGW stuff, as the latter uses the ancient, slow and buggy MSVCRT libc implementation. Building the same project with clang in cygwin (statically linked, so the only dependency is a singular cygwin DLL file!) results in a much faster binary.
@Dennis I could have sworn TIO had Half-Broken Car in Heavy Traffic. was there some problem with the interpreter or did I actually never request that to be added?
Alphabetize Integers
code-golf sorting
For a given set of numbers, put them in alphabetical order when they are spelled out. For example, 1, 2, 3, 4, 5 would output to 5, 4, 1, 3, 2 (five, four, one, three, two). Your code should accept any number of integers of maximum length six. It should al...
A Numpad's Knight Numbers Extended Edition
This challenge is an extension of the one linked above by Calvin, and inspired by a comment by Darrel Hoffman.
My computer has a numpad which is significantly more expansive than Calvin's. For reference, it looks like this:
🔒/ * -
7 8 9 +
4 5 6 +
1 2...
You need to produce output that is non-deterministic.
In this case, this will be defined to mean that the output cannot be known to be a specific result.
Rules:
A pseudo-random number generator that always has the same seed does not count.
You can rely on the program being run at a different ...
