text
stringlengths
26
126k
[Question] [ **GolfScript** automatically coerces values, according to the following ‘priority’ sequence: > > integer → array → string → block > > > (listed from lowest to highest.) This means that `"1"7+` leaves the string `"17"` on the stack (and not `8`), because strings have a higher priority than integer...
[Question] [ Output the **current time of day** as [Swatch Internet Time](https://en.wikipedia.org/wiki/Swatch_Internet_Time). Specifically, output a three-digit (zero-padded) number of "[.beats](https://en.wikipedia.org/wiki/Swatch_Internet_Time#Beats)" (1000ths of a day) which represent the current time of day ...
[Question] [ Write a program that, given any 'n' number of strings of 'm' length, returns 'm' number of 'n'-length strings, with this condition: **Every new string should contains the letters at the same index of the others strings** For example, the first output string must contain the first letter of all the in...
[Question] [ The goal here is to simply reverse a string, with one twist: Keep the capitalization in the same places. Example Input 1: `Hello, Midnightas` Example Output 1: `SathginDim ,olleh` Example Input 2: `.Q` Exmaple Output 2: `q.` **Rules**: * Output to STDOUT, input from STDIN * The winner will be...
[Question] [ [Inspiration](https://codegolf.stackexchange.com/q/59299/43319). ### Task Reverse runs of odd numbers in a given list of 2 to 215 non-negative integers. ### Examples `0 1` → `0 1` `1 3` → `3 1` `1 2 3` → `1 2 3` `1 3 2` → `3 1 2` `10 7 9 6 8 9` → `10 9 7 6 8 9` `23 12 32 23 25 27` → `23 12 ...
[Question] [ **Note: the first half of this challenge comes from Martin Ender's previous challenge, [Visualize Bit Weaving](https://codegolf.stackexchange.com/questions/83899/visualise-bit-weaving).** The esoteric programming language [evil](http://esolangs.org/wiki/Evil) has an interesting operation on byte valu...
[Question] [ One of the most common standard tasks (especially when showcasing esoteric programming languages) is to implement a ["cat program"](http://esolangs.org/wiki/Cat): read all of STDIN and print it to STDOUT. While this is named after the Unix shell utility `cat` it is of course much less powerful than t...
[Question] [ ### Definition Define the **n**th array of the CURR sequence as follows. 1. Begin with the singleton array **A = [n]**. 2. For each integer **k** in **A**, replace the entry **k** with **k** natural numbers, counting up from **1** to **k**. 3. Repeat the previous step **n - 1** more times. For exampl...
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []
[Question] []