# What is the Sandbox?

This "Sandbox" is a place where Code Golf users can get feedback on prospective challenges they wish to post to the main page. This is useful because writing a clear and fully specified challenge on the first try can be difficult. There is a much better chance of your challenge being well received if you post it in the Sandbox first.

See the Sandbox FAQ for more information on how to use the Sandbox.

## Get the Sandbox Viewer to view the sandbox more easily

To add an inline tag to a proposal use shortcut link syntax with a prefix: [tag:king-of-the-hill]

...?

# Fork for n times

TL;DR: fork up to n times, than hang forever

Relevant chat discussion

Your challenge is to make a program / function that calls itself twice or uses some other method of creating copies of itself that create copies of itself, etc.

However, to avoid crashing the system, your program limits itself before it forks to death. Given an input n, your program should stop forking when it has n total copies of itself (including itself), and keep running forever with n total copies of itself.

# Meta

• Under-specified?
• Is the min of 500 good?
• Tags?
• Better title?
• It's not exactly a dupe of this one, but that one is the same spirit, and it's closed and locked, so I wouldn't expect this to be well received. Also see this and this – James Aug 22 '17 at 21:41
• @DJMcMayhem see edits – programmer5000 Aug 22 '17 at 22:05

# Where do I live? code-golfgeography*

Given a coordinate pair, supporting at least 2 decimal places (precision .01), determine the country containing that coordinate pair. The coordinate will be on land and will be at least ~0.5 degrees (~50 km Great Circle distance; thanks Peter Taylor!) from any border or coastline.

Input will be given as two decimal numbers in any reasonable format. Output should be the English name of the country according to this source; spaces, accents, non-alphanumeric characters, and capital letters are all optional. For countries like Iran, you can choose to output either "Iran" or "Islamic Republic of Iran". The same applies for all ...Republic... countries, like N/S Korea, Lao, Taiwan, etc. For Côte D'ivoire, you can choose to output either "Côte D'ivoire" or "Ivory Coast".

Exact built-ins are not allowed (ahem Mathematica). Online APIs are not allowed (ahem Google Maps).

Western and Southern coordinates can be given as a negative decimal or with W and S (you can also have N and E if wanted). Please specify your input format.

You will have to handle coordinates in Antarctica. Apparently it's a country now.

# Test Cases

Input           -> Output

43.26N,  79.54W -> Canada
37.42N,  94.88W -> United States of America
25.96N, 103.51W -> Mexico
9.39S,  59.39W -> Brazil
79.66S,  65.22E -> Antarctica
90.00S,  00.00E -> Antarctica # It's such a shame that 90N ?E/W is in the middle of the ocean
74.25N,  40.00W -> Greenland
63.08N,  15.34E -> Sweden
66.19N,  98.93E -> Russia
30.72N, 103.39E -> China
2.89S, 119.55E -> Indonesia
26.96S, 132.91E -> Australia


* not a real tag but I propose to add it

• Does "at least 0.5 degrees from any border or coastline" mean "at least 55.6km from any border or coastline" (i.e. great circle distance)? – Peter Taylor Sep 11 '17 at 8:34
• @PeterTaylor Yes, thanks for the calculation. I'll just say ~50 km, thanks. – HyperNeutrino Sep 11 '17 at 12:12

[tag:H̸̡̪̯ͨ͊̽̅̾̎Ȩ̬̩̾͛ͪ̈́̀́͘ ̶̧̨̱̹̭̯ͧ̾ͬC̷̙̲̝͖ͭ̏ͥͮ͟Oͮ͏̮̪̝͍M̲̖͊̒ͪͩͬ̚̚͜Ȇ̴̟̟͙̞ͩ͌͝S̨̥̫͎̭ͯ̿̔̀ͅ]

# Parse HTML with regex!

Alternate titles:

# Background

Don't parse HTML with regex. It always fails and sometimes summons Cthulhu.

But, because PPCG is different, we will parse HTML with regex.

And not easy, beginner HTML. HTML with comments, attributes with no quotes, HTML in script tags not commented out and much more. Can you write a regex to parse that?

# The challenge

Your challenge is to make a regex that matches valid HTML tags. Don't match comments, don't match invalid HTML, don't match HTML in comments, just match valid HTML tags. Each full regex match is one HTML tag.

Your input HTML will never contain commas. You will try to get the most points possible by successfully matching the HTML tags and not the text in as many inputs as possible. Whoever gets the most points wins. Please say at least 1 regex flavor that your regex works with.

You are not allowed to use regex features to execute language code. (Sorry, Perl)

The length of your regex is irrelevant, this is not code golf.

# Test cases

Here are the test cases. You can also find them at https://hastebin.com/raw/mikaxakipe.txt.

1,1,<b>HTML!</b>,<b>,</b>
2,1,<i><b>HTML</b></i>,<i>,<b>,</b>,</i>
3,1,a < b implies b > a,
4,2,<img alt=text>Img,<img alt=text>
5,2,<a href = "http://example.com">Example Domain</a>,<a href = "http://example.com">,</a>
6,2,<hr><br/>,<hr>,<br/>
7,2,<div id ="hi" class="what">What</div>,<div id ="hi" class="what">,</div>
8,3,<a>fake</>,<a>
9,3,Self-closing <img src = "self-closing.jpeg" />?,<img src = "self-closing.jpeg" />
10,3,<self-closed/>O_O<unclosed>,<self-closed/>,<unclosed>
11,3,Do<yOU>like<LoTs>of<mIXeD><cAsE>?,<yOU>,<LoTs>,<mIXeD>,<cAsE>
12,3,Wh<a b='c'd="e">at?,<a b='c'd="e">
13,3,Hi<p data-hi=3>hihihi</p>,<p data-hi=3>,</p>
14,4,<a"oops">Oops,
15,5,<!-- <b><!--hi--><i>,<i>
16,5,<0>NOT VALID</0><h0>fine</h0>,<h0>,<h0>
17,5,<a a=b<>what</a>,<a a=b<>,</a>
18,6,<!-- <b><!--hi--><i>-->,<i>
19,7,<how><deep can><your nesting nesting><level></level></go>?<how>Deep</how><can><your>nesting <go x=? j><how><deep can><your nesting nesting><level></level></go>?<how>Deep</how><can><your>nesting <go x=? j><how><deep can><your nesting nesting><level></level></go>?<how>Deep</how><can><your>nesting <go x=? j></your></can></your></deep></how></your></can></your></deep></how></your></can></your></deep></how>,<how>,<deep can>,<your nesting nesting>,<level>,</level>,</go>,<how>,</how>,<can>,<your>,<go x=? j>,<how>,<deep can>,<your nesting nesting>,<level>,</level>,</go>,<how>,</how>,<can>,<your>,<go x=? j>,<how>,<deep can>,<your nesting nesting>,<level>,</level>,</go>,<how>,</how>,<can>,<your>,<go x=? j>,</your>,</can>,</your>,</deep>,</how>,</your>,</can>,</your>,</deep>,</how>,</your>,</can>,</your>,</deep>,</how>
20,7,<plaintext><b></plaintext>,<plaintext>,</plaintext>
21,7,What<img src="imgs/>lolz.png" alt = "<heh"/>,<img src="imgs/>lolz.png" alt = "<heh"/>
22,7,<b><a href = "#" title = "4 > 3">hi</a></b>,<b>,<a href = "#" title = "4 > 3">,</a>,</b>
23,10,<StYle><b title = "not in html"></style><B>HTML!</b><style></style>,<StYle>,</style>,<B>,</b>,<style></style>
24,10,<script>//<script>< /script></script><script></script><p>,<script>,</script>,<script>,</script>,<p>
25,10,<i></i this="will be removed by a browser">,<i>,</i this="will be removed by a browser">
26,10,<div id="hi" class=class="what" data-the="heck='is'this" get-good>Attributes are weird<div>,<div id="hi" class=class="what" data-the="heck='is'this">,<div>
27,10,<!--<b>Do you like comments??</b>--><p>,<p>
28,13,<textarea><script>/* *////*///*<!--</script><b>WHAT</b></textarea><i>Hi-->,<textarea>,</textarea>,<i>
29,15,<!--<b>Do you like comments??</b><script>--><script>//<!--hello</script><b>hi</b><!--What--><script>//<!-- <script> <!-- <script> --> </script><i>hello--><script></script>,<b>,</b>,<script>,</script>,<i>,<script>,</script>
30,15,<hi>hi</hi><0>hi</0><h0>hi</h0><h&>hi</h&><&>hi</&><??>hi</??><?php>hi</?php><php?>hi</php?><->hi</-><_-_>hi</_-_><h->hi</h-><_>hi</_><h-_>hi</h-_><?>hi</?><{>hi</{><h{>hi</h{></>hi<//><h~!@#$%^&*()>hi</h~!@#$%^&*()><h>hi</h><h~>hi</h~><h!>hi</h!><@>hi</@><h@>hi</h@><h!@#$%^&*()>hi</h!@#$%^&*()><@f>hi</@f><%>hi</%><;>hi</;><h>>hi</h>><h&>hi</h&><h~>hi</h~>,<hi>,</hi>,<h0>,</h0>,<H&>,</H&>,<PHP?>,</PHP?>,<h->,</h->,<H-_>,</H-_>,<H{>,</H{>,<H~!@#$%^&*()>,</H~!@#$%^&*()>,<H>,</H>,<H~>,</H~>,<H!>,</H!>,<h@>,</h@>,<h!@#$%^&*()>,</h!@#$%^&*()>,<H>,</H>,<H&>,</H&>,<h~>,</h~>
31,30,<hi>hi</hi><0 WHAT_is=HtMl>hi&<i attrubute="oops'></0><h0 attRiBu350Te="<b>oops</b><style>/*">hi</h0>*/<h&>hi</h&><&>hi</&><??>hi</??><?php>hi</?php><php?>hi</php?><->hi</-><_-_>hi</_-_><h->hi</h-><_>hi</_><h-_>hi</h-_><?>hi</?><{>hi</{><h{>hi</h{></>hi&<//><script>     &/*<h~!@#$%^&*()>*/</ script></StyLe>/*</ScrIPT>/*<b>oops</b>hi</h~!@#$%^&*()><h>hi</h><h~>hi</h~><h!>hi</h!><@>hi</@><h@>hi</h@><h!@#$%^&*()>hi</h!@#$%^&*()><@f>hi</@f><%>hi</%><;>hi</;><h>>hi</h>><h&>hi&</h&><h~>hi/*/</h~><b>oops</b>hi</h~!@#$%^&*()><h>hi</h><h~>hi</h~><h!>hi</h!><@>hi</@><h@>hi</h@><h!@#$%^&*()>hi</h!@#$%^&*()><@f>hi</@f><%>hi</%><;>hi</;><h>>hi</h>><h&>hi&</h&><h~>hi/<script></StyLe></ScrIPT><textarea><b>HE COMES</b></textarea><h!>hi</h!><@>hi</@><h@>hi</h@><h!@#$%^&*()>hi</h!@#$%^&*()><@f>hi</@f><%>hi</%><;>hi</;><h>>hi</h>><h&>hi&</h&><h~>hi</h~>,<hi>,</hi>,<i attrubute="oops'></0><h0 attRiBu350Te="<b>,<style>,</style>,<textarea>,</textarea>,<h!>,</h!>,<h@>,</h@>,<h!@#$%^&*()>,</h!@#$%^&*()>,<h&>,</h&>,<h~></h~>  Each line is a separate test case. They are in this format: 1,1,<b>HTML!</b>,<b>,</b> | | | | | | | | +---+- The correct output: all HTML tags in the string separated by commas | | +- The HTML for you to parse | +- The number of points you get if you parse this HTML correctly +- The test case number  # Example Let's say we have the regex /<.*?>/g (all flavors). For test case #1, it matches 2 times: <b>, and </b>. The correct output in the test case says that it should match <b> and </b>, so it is correct. Our regex gets 1 point. Then for test case #2. Our regex matches <i>, <b>, </b>, and </i>, which is consistent with the test case so we get 1 point. Now for test case #3. Our regex matches < b implies b >, when it should have not matched anything. We get 0 points for that. Continuing for each test case gets us a score of 50 (out of 207, or 24.15%). Not great. Can you do better? # Try It Online If your regex will work with the ECMAScipt / JS flavor than you can try it here and get automatic scoring! # Tie breaker Here are the scoring systems. Whoever has the best score on the first wins. In the event of a tie, whoever out of the ties scores the best wins, etc. 1. Most points 2. Shortest length 3. First posted # Answer format # [insert score here] / 207 points [insert regex here]  Explanation (optional but encouraged) Proof of score (matched output vs. test cases, link to TIO to try it, etc.) # Meta • Any tie breaking for regexes with the same score, e.g. length? – Laikoni Sep 11 '17 at 5:28 • 1. This is a meta-regex question, and scoring it just on test cases means that there are already programs out there which will generate a regex that gets a perfect score. As it stands it's a pretty pointless contest. 2. I don't see a specification for an HTML tag, or even a link to one. Why, for example, is < b implies b > invalid? Without a spec it's even more a meta-regex question rather than an HTML question. 3. This isn't parsing HTML with regex. It's closer to lexing HTML with regex, and no-one said that that was impossible or would summon the Elder Ones. – Peter Taylor Sep 11 '17 at 7:50 # Matrix Decomposition ## Meta • Duplicate? • What rules should I add? • Are my explanations sufficient? • Any room for improvement? It's possible to "factor" any invertible (a.k.a. non-singular) square matrix A into a combination of a permutation matrix1 (P), a unit3 lower triangular matrix2 (L), a diagonal matrix4 (D), and a unit upper triangular matrix2 (U). That is, A = PLDU For instance, the matrix [[4, 5], [2, 3]] can be expressed as the multiplication of the following matrices: P = [[0, 1], [1, 0]] L = [[1, 0], [2, 1]] D = [[2, 0 ], [0, -1]] U = [[1, 3/2], [0, 1 ]]  # Task Given an invertible square matrix A, output P, L, D, and U. # Test Cases TBD  # Rules • Any reasonable output format is acceptable, but P, L, D, and U must be separate outputs. 1. A permutation matrix is a permutation of the identity matrix. 2. An upper triangular matrix is a square matrix whose nonzero values occur only on or above the main diagonal, and a lower triangular matrix is a matrix whose nonzero values occur only on or below the main diagonal. 3. A unit triangular matrix is a triangular matrix whose main diagonal is all 1s. 4. A diagonal matrix is a matrix whose nonzero values occur only on the main diagonal. # Become a Word-Pontif The french used to define the word pontif as one who builds bridges stemming from the conjunction of pons, facere which literally translates to a bridge, to create one. Your task will be, given a list of 1 or more lower-case words l (String Array), output the MAXIMUM length of a bridge that can be built from these words. # Bridge Rules • Bridges can be made by connecting two or more words together: • Words must be connected prefix-to-suffix or suffix-to-prefix. • To join two words into one: • The suffix of the first must match the prefix of the second (abc+cba=abcba). • The prefix of the first must match the suffix of the second (earl+toe=toearl). • If a word's prefix/suffix contains more than one common character: • You can only connect them with the maximal common substring. • In other words,abc and bcdefg can be connected using a[bc]defg. • The length of a bridge is simply the length of the conjoined words in characters. # Building Material Rules • The list will contain at fewest 1 word. • The list may hold 0 links between words, in this case the maximal size is the longest word in the list. • The list will not contain the empty string and will only use the lowercase alphabet (a-z). • The list MAY NOT contain duplicates. # Examples Example 1: [abcdefgh,holographic,graphical,quine,loitering] abcdefholo[graphic]al = 19 19  Example 2: [noon,moon,loon,noon,groom] groo[m]oon 8  Example 3: [spoon,whatifgodwereoneofus,oneofusisatraitor,aaaaaaaaaaaaaa,aaaaaaaaaa] whatifgodwere[oneofus]isatraitor (because the two aaaaa's overlap too much). 30  Example 4: [abc,def,ghi,jkl,mnop,qrst,uvwxyz] uvwxyz (No matches) 6  Example 5: [xox,xxox,lol,lolol,lololol,xoxx] xo[xx]o[x]ox < 8 (Maximal of the xox path) [lol]o[l]ololol < 10 (Maximal of the lol path) 10  Example 6 (Base): [hi] hi 2  Example 7: # Note, when a link has been used it cannot be used twice. # In other words, the brackets used cannot overlap in these examples. [aa,aaa,aaaa] aa[aa][a]a (Chose to use aaaa,aaa,aa) 7  # General Rules • 1. This is extremely close to codegolf.stackexchange.com/q/132561/194 . 2. Examples 5 and 7 look wrong. – Peter Taylor Sep 12 '17 at 8:52 • In example 1, isn't it abcdefgholographicaloitering = 28? – KSmarts Sep 18 '17 at 14:22 # Word Grid Pathfinding A follow up to Generating Word Grids and Validating Words in Word Grids. ## Meta My original idea for this was to have entries compete, but I'd like to have different winning conditions. Given grid x, pit all scripts against each other for the following win criteria: • Highest Score • Shortest Path • Fewest remaining tiles • Longest Words but I think perhaps just making it code golf and offering a bounty to each of the criteria above after some time. I'd like some feedback on this. I like @LegionMammal978's idea, but feel like perhaps that could be a separate challenge (again, only if these are interesting to anyone!) Given a grid of letters, complete a path of words that reaches from the centre of the board, to the edges. You must return lists of your moves as co-ordinates and your score will be tallied. As soon as there is a clear path from the centre to the edge, the game is over, and no further words will be scored. ## Details Grids will always have an equal, odd, number of rows and columns, such that no direction contains fewer tiles. ## Restrictions In the event that the grid is unsolvable (or becomes unasolvable because of your chosen path, you may return something falsy instead of a list of co-ordinates. Your script must be able to handle grids of varying sizes and solve them in a reasonable time, such that a service like TIO can be used, without causing problems in most cases, for extremely large inputs (> 500). You are free to take input in any reasonable format, but please include a link to your script with a wrapper such that it can take input in via STDIN/script arguments via an online service. #TODO: copy details of the adjacency rules from above. For example, in the grid provided below, the J, I, P or O letters (north, east, south and west of the blank square) must be included, once this word has been removed, you have more available words. There are bonus letters that provide a double point score, denoted by a lowercase letter or ! (instead of ? for a blank tile). Blank tiles are used exactly as they are in Scrabble and can count as any letter, the validating program will search for words replacing the ? (or !) with a wildcard. Letters are scored as per Scrabble: 0 points: blank tiles 1 point: E, A, I, O, N, R, T, L, S, U 2 points: D, G 3 points: B, C, M, P 4 points: F, H, V, W, Y 5 points: K 8 points: J, X 10 points: Q, Z  Your score will be calculated by the validator. ## Examples Input: UWDESTKP? ItDBaDEdI TERMDYTSR ROANJLEFT EkCI OOsT IPAJPGMNY MZLORITVI GwEGgPUeI MNROYOEER  Output: 6,4 6,5 5,5 4,5 3,5 3,6 2,6 1,6 5,6 4,6 4,7 4,8  Total moves: 2 Points: 21 #TODO: more examples. # Shift-left golfer Sometimes when doing code-golf, a person needs to understand which format is shorter: • 2147483648 • 0x80000000 • 1<<31 The task: You will receive a number in one of the three formats above: decimal, hexadecimal, or shift-left operation. If there is no advantage in converting it to another format, just leave the number the way it is; otherwise I want the shortest format. Of course there are numbers you can't convert to shift-left format! # Notation: • Hexadecimal0x#######.... where there are no leading zeros after the x. When accounting for evaluating the golfiness, the 0x part is also taken into consideration. For example 0x80000000 has a length of 10. • Decimal#######.... where there are no leading zeros. • Shift-left#...<<#.... no leading zeros both sides of <<. The << operator is also considered for length, e.g 1<<31 has a length of 5. You must also handle multiple digits before the << signal. # represents a digit and ... represent possible repetition of digits I don't care if you handle leading zeros at the input or not; but if you handle them, you must do the comparison operations without them and output also without them — You're a golfer, come on! You will understand! There will be no accepted answer. , so I want to know shortest answer by language. # UPDATE 1: In spite of @dzaima 's comment, now it also needs to handle multiple digits before << signal. • How about just take an integer as input and return the shortest form as output? – HyperNeutrino Sep 15 '17 at 19:20 • 1<<31 has a length of 4 not 5? – Rɪᴋᴇʀ Sep 15 '17 at 22:38 • @Riker: Sorry, my mistake. Now fixed. – sergiol Sep 15 '17 at 22:59 • @dzaima: Updated. Yes, it will need to handle multiple digits before << – sergiol Sep 16 '17 at 11:07 • If you allow non-ones in front of the byte shift as input, but not as output, an input like 99<<99 would result in the output having more bytes than the input. – Jonathan Frech Sep 18 '17 at 5:23 • What about something like 0x45<<0x378? i.e., why not hex numbers in left-shifts? – wastl Jul 7 '18 at 20:38 # Translate Tetris moves to GoL! Unless you've been living under a rock, you're probably aware of the fact that the highest voted unanswered, incredibly hard challenge to build a working game of Tetris in Conway's Game of Life just recently got answered. (Go check it out if you haven't already.) Unfortunately, since this game is written in Conway's Game of Life, giving input to the code is a bit tricky. (Of course, if they can simulate Tetris in GoL, you can play it with tricky moves. :P) To quote the main answer: Each move only requires editing a single bit of RAM, and this input register is automatically cleared after the input event has been read. Each Tetris move corresponds to a single number by the following table: value motion 1 counterclockwise rotation 2 left 4 down (soft drop) 8 right 16 clockwise rotation  Now, of course, if there was only a way to automate this... ## Challenge Write a program/function that takes a series of keypresses as input and outputs each keypress' respective number according to the table above. The keypresses should map as the following: value motion < counterclockwise rotation <left arrow> left <down arrow> down (soft drop) <right arrow> right > clockwise rotation  ### Specifications • Standard I/O rules apply. • Standard loopholes are forbidden. • This challenge is not about finding the shortest approach in all languages, rather, it is about finding the shortest approach in each language. • Your code will be scored in bytes, usually in the encoding UTF-8, unless specified otherwise. • Built-in functions that perform this task are allowed but including a solution that doesn't rely on a built-in is encouraged. (Pshh, how likely is that?) • Explanations, even for "practical" languages, are encouraged. ### Test cases // incoming  # Sandbox • Should I switch from keypresses to strings of ( < v > )? • I'm really lacking on tags... • Bump! • Not all languages can support keypresses, so using a string would be better. – fireflame241 Sep 23 '17 at 18:20 • Also, if you go for keypresses: What happens if I hold a key for 10s? What happens if I hold a key and simultaneously press another one? – ბიმო Sep 25 '17 at 11:04 # Two-Symbol n-state Universal Turing Machine A program is defined as a set of transition rules from one state to another based on the current state and symbol, optionally moving the tape head left or right. The goal is to produce a program that satisfies all of the following criteria: • It is a two-symbol Turing Machine program. • It emulates a two-symbol Turing Machine program that is represented on the tape. • where all tape that is not data is initialised to one symbol (designated 0 - the other is 1). There are two scoring criteria: 1. The number of states. Smaller is better. 2. The compressibility of the program format (see below). There is an individual scoring for each criterion and a combined position. The combined position is the sum of the ordinal positions in the leaderboard for each criterion (e.g. if your solution is 1st for number of states but 4th for compressibility it has a combined position of 5th). In the likely event of a tie, the compressibility of the program format is the tie-breaker. ## Compressibility of the Program Format The compressibility of the program format is defined as the number of (additional) states required to write the program onto a blank (0) tape, move the head to the start position of the program and start running the emulator on the program (change state to a correct emulator state). Sandbox note: Hand-compressed test-cases? Average-case Big O? • Todo: Work in a reference to this article and how a good solution to this challenge will reduce the upper bound for the maximum computable value of the Busy Beaver function. – wizzwizz4 Sep 22 '17 at 20:49 • Is there a way to tell the Kolmogorov complexity when compressed through a certain method? It seems like the compressibility of the input format is poorly defined and will vary between inputs. – wizzwizz4 Sep 22 '17 at 20:54 • I'm not quite seeing the busy beaver connection. Clearly it's not about emulating a single program, because in general the program itself would have fewer states than the program which puts it onto the tape and then runs the emulator; so it must be about some kind of loop over all programs, but then you run into undecidability of the termination of the emulator programs, meaning that the emulator certainly doesn't terminate. – Peter Taylor Sep 23 '17 at 20:25 # It’s raining numbers! Better to get a good umbrella! Your task is to take in one integer input and print a “raining” alternating pattern with that number, and an umbrella of appropriate size to protect yourself from such a rain! # Examples 1 => 1 _|_ / \ ----- | C 2 => 2 2 ___|___ / \ --------- | | C 3 => 3 3 3 3 3 _____|_____ / \ ------------- | | | C 4 => 4 4 4 4 4 4 4 4 _______|_______ / \ ----------------- | | | | C 10 => 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 ___________________|___________________ / \ ----------------------------------------- | | | | | | | | | | C  # Rules • The output should use only the ascii characters _ | - / \ C, space, and the digits (no tabs are allowed). • Numbers should have an alternating pattern, two digits on the same line are separated by 7 spaces. • Number with more than one digit must be written vertically. • The size of the first line of the top of the umbrella should be equal to 4n-1, for input n, centered below the “rain”; the size of the second line should be equal to 4n+1. • The shank of the umbrella under the top is centered and should be of height n (the | characters), and terminated by a C handle. • Lines can have trailing spaces. This is a task, so the shortest solution is any language wins. • shortest solution in any – Adám Sep 27 '17 at 7:36 • I think that you should explicitly state the input for each example output. – H.PWiz Sep 27 '17 at 9:21 • Allowed whitespace should be mentioned in the first rule. Regular spaces seem obvious, but using tab characters in place of 4 spaces could be used and it's a good idea to explicitly allow or forbid it. Also, that rule should start with "The output should..." to clarify that this is not restricted-source – Kamil Drakari Sep 27 '17 at 14:46 # Sort a nested object by nested value Your goal is to sort a nested object by a nested value. What does that mean? For example: #1: Input { foo: { category: "A", hello: "world", color: "blue" }, bar: { category: "B", cu: "cumber", color: "blue" }, baz: { category: "A", let: "tuce", color: "green", } }  #1a: Output sorted by category { A: { foo: { hello: "world", color: "blue", }, baz: { let: "tuce", color: "green" } }, B: { bar: { cu: "cumber", color: "blue" } } }  #1b: Output sorted by color { blue: { foo: { hello: "world", category: "A" }, bar: { cu: "cumber", category: "B" } }, green: { baz: { let: "tuce", category: "A" } } }  Note that the sorting key is always deleted from the objects (when sorting by color none of the items contain color). ## Your task Given an object, and a sorting key (a string), output the sorted object as shown. ## Rules • You can always assume that the value of the sorting key is a string (as it also needs to be a key in the output) • You can always assume that the given sorting key exists in all values • Sorting will only occur on the first-level objects, but the sorting key can be nested (see test case #2) • The object may be a JSON object, a python dict, a JS object, etc. but must always have string only keys. • You may accept the object as a JSON string and/or return a JSON string. ## Test Cases #2: Input Sort by: rating.healthiness { icecream: { sweet: true, rating: { tastiness: "8", healthiness: "4" } }, pizza: { sweet: false, rating: { tastiness: "9", healthiness: "3" } }, chocolatecake: { sweet: true, rating: { tastiness: "8", healthiness: "3" } } }  #2: Output (sorted by rating.healthiness) { "3": { pizza: { sweet: false, rating: { tastiness: "9" } }, chocolatecake: { sweet: true, rating: { tastiness: "8" } } }, "4": { icecream: { sweet: true, rating: { tastiness: "8" } } }, }  ## Sandbox Questions 1. I really need to make the question clearer. Any thoughts? How can I better describe the task? 2. Is this a duplicate? 3. I'm guessing I need a better title. Any ideas? 4. Should I make the input a JSON object or just a general object? 5. Are multi-level nested objects even possible? Would it be too easy without them? 6. Should I also allow booleans & numbers as the value for the sorting key (and then in a key form it would be stringified)? # Output the Yggdrasil graph In Norse mythology, Yggdrasil, or the world tree, is a giant tree that spans the entire universe and connects all nine worlds of the Norse mythology together. Here, we shall take a rather liberal reinterpretation of the term "world tree" - it's the tree that contains all other trees as subgraphs. Not only that, but each graph is present everywhere in Yggdrasil. Clearly, the only way to achieve that is if every node in the graph has infinitely many neighbors. Yggdrasil is the unique (up to isomorphism) non-empty graph with the two properties that each vertex has ℵ₀ neighbors and that there is a unique simple path between any two vertices. In other words, Yggdrasil is the Cayley graph of the free group with countably infinitely many generators. Your goal is to output this graph. Nodes can be given any printable label of your choice, as long as they are non-empty and unique within the graph. Edges shall be denoted as pairs of vertices in either order. It must be clear from the output which are the two nodes in a graph (a-b-c is not an acceptable representation of an edge from a-b to c, but ["a-b", "c"] is fine). In the output, each edge shall be output on a single line, and different edges shall go on different lines. The output should be just the list of edges in the graph, one edge per line. Each edge in the graph must be output exactly once, and in a finite amount of time (barring memory limitations). Edges not in the graph must not be output. For example: • Listing the edges in breath-first order is not sufficient, as any edge disjoint from the root would not get output. • Listing the edges in depth-first order is not sufficient, as no more than two edges of any node would ever get output. • It is sufficient (but not necessarily optimal) to generate the output by repeating (for each node in a copy of the list of known nodes, take the first unknown child, output the edge to it and add it to the list of known nodes). The sufficient example above will output, if nodes are labeled 0, 0 1, 0 2, 0 1 1, ... : 0 => 0 1 0 => 0 2 0 1 => 0 1 1 0 => 0 3 0 1 => 0 1 2 0 2 => 0 2 1 0 1 1 => 0 1 1 1 ...  • So basically we have a countably infinite set of vertices V, a countably infinite index set I, and an injection (V x I) -> V. Since any bijection is an injection, we can use minor variants of e.g. codegolf.stackexchange.com/q/8892/194 , codegolf.stackexchange.com/q/78606/194 , codegolf.stackexchange.com/q/48705/194 with a loop for(n=0;;n++) wrapped round to create a valid answer. So although quite well disguised this is actually a dupe. – Peter Taylor Oct 3 '17 at 8:34 • @PeterTaylor not sure how that would work. Are you trying to output the complete infinite graph rather than the infinite order regular tree? – John Dvorak Oct 3 '17 at 9:00 • Use the reverse direction of the bijection: N -> (N x N). Then for(n=0;;n++)print(unpair(n)[0],"=>",n). Every node has an infinite number of successors, but each node has only one predecessor, so it's a tree. For the previous questions which use a bijection N -> (Z x Z) it's ever so slightly more subtle: to enumerate the entire tree we need to add in a bijection N -> Z and write for(n=0;;n++)print(unpair(n)[0],"=>",z(n)), but there are some very simple bijections N -> Z. – Peter Taylor Oct 3 '17 at 9:28 # Is my Sukkah Kosher? Do not rely on this text for questions of Jewish law! You will be given a floor plan of a sukkah as follows: • A rectangular 2D text (in any reasonable format). • The first and last rows and columns will consist of printable ASCII (32-126). • All interior characters will be spaces. Determine if the sukkah is acceptible according to these simplified rules, using the scale of one character width/height representing the tefach unit. • The inner area, as encompassed by the completion of the two longest solid walls into a square, must be at least 6 units by 6 units. • If the two longest solid walls are across from each other, then the shorter one must be at least 6 units long, and the length with with they are diametrically across from each other must also be 6 units long. • There must be an additional wall which is at least one unit long. • The walls may be made of any material, i.e. any character except space. • Walls with single unit gaps are still considered solid. You may answer with any two distinct values, but please specify if different from true/1 and false/0. Explanations are appreciated. ### Acceptable oOOOo.ooo...o--o # @ # ) # ( # | # +++++++*******  oOOOo.ooo...o--o @ @ @ +++++****  o O o o o . o @ @ @ +++++****  ### Not acceptable oOOOo.ooo...o--o # @ # ) ( | # ++++ ****   oOOOo.ooo.. @ @ @ +++++****  o O o o o . o @ @ @ 8 8  ## A Conc-urn-ing Problem You have a mysterious urn, which contains 0 <= n <= 10 sets of k balls. Each set of balls shares a numeric label, from zero to n-1. You perform a repeated experiment, wherein you remove a ball from the urn, and note its number. If the number of balls in the urn with the same label as the ball you removed has the highest or tied for highest frequency still in the urn, you put the ball back in. Taking the recorded results of each of the trials yields an infinite sequence. For example, you might have for n=2, k=2 pulled: 1001000000... Given n and k write a program or function that returns a regular expression which will match any valid real number generated by this process, and which fails to match any other real number. ### Sandbox This is missing quite a bit (haven't written a program yet), but I'm not sure if it is too tedious the way that it currently is. It's somewhat boring if restricted to n=2 but rather quickly becomes tedious after that. Since most of the result would be symmetric, would it make sense to only require the "first" result? This also seems like it removes too much of the interest in the problem. # Search Stack Overflow for Duplicates The Stack Overflow search algorithm has been under fire recently. Several problems with the search algorithm being flawed exist, but one of the most important issues raised is with duplicates: [...] The search engine is used while authoring a question to find potential duplicates. At that point there is no way for you to take advantage of its features through custom search operators, and it absolutely, positively must be as good as an external search engine in this scenario. Unfortunately, it isn't. – IInspectable (source) A flawed duplicate search algorithm causes a lot more work for the comparatively few reviewers and duplicate closers than there should be, by not informing the question askers that the question that they are attempting to post is a duplicate. It is also bad for the question askers, preventing them from finding the answer to their question until somebody reviews the question. This is where you come in. Given the title, body and tags of a question, output a list of 25 relevant questions in a reasonable format (e.g. question ids). Your program should run within 500ms on the Stack Exchange servers for each question. (Sandbox note: How fast are the Stack Exchange servers? What conversion factor should I use to test on my hardware?) You have access to all T-SQL database tables available from the Stack Exchange Data Explorer, but the current question that needs to be checked for duplicates will be absent from all tables (so it isn't found as a duplicate of itself). To test the algorithm, it would be tested on a random selection of or all of the existing duplicates on Stack Overflow - the algorithm with the lowest average position of the duplicate master(s) in the list would win, where "not in the list" is counted as 50. The set of existing duplicates tested would be the same for all algorithms to test - rationale includes scoring of questions with multiple duplicate masters. The search algorithm should be deterministic. It is allowed to prepare a cache table beforehand - none of the duplicates to test will be passed to this part of the algorithm. This cache table should be able to be updated with new questions without being completely rebuilt. (Sandbox note: How to score this?) (Sandbox note: The final paragraph should be spread out and better laid out and reworded, but I think the wall of text contains enough information.) # Constructively golf true primes! ## Introduction A recurring pattern that I see in challenge involving primes is the (over-) use of prime-checking built-ins and of factorization built-ins. However, I kinda don't trust especially the latter, which is why today, we're gonna build primes and include a certificate that the result is actually a prime. ## Input A positive integer n denoting the length of the resultung prime in a basis of your choice. ## Output A list of primes in the base you picked above, one of these primes is of length n and one of these primes is smaller than 20. ## What to do? Your challenge is to generate a prime of length n of which the primality can be reduced to the primality of one of the following primes: [2,3,5,7,11,13,17,19]. This can be achieved using Pocklington's criterion. Now the idea is to chain up from any of these primes using said criterion to a prime of appropriate size, while also outputting the intermediate steps so primality can be checked easily. For your convenience, I shall reproduce the relevant theorem here: Let N>1 be an integer and suppose there exist a,q such that • q is prime • q divides N-1 • q>sqrt(N)-1 • a^(N-1) mod N == 1 • gcd(a^((N-1)/q)-1,N)=1 Then N is prime. And as you might see, your initial set of primes (as candidates for q) is limited to the above short list of primes smaller than 20. ## Who wins? This is so the shortest solution in bytes wins! However this is also so all solutions must run in (expected) polynomial time in n. Standard IO and Loophole rules apply. ## Got any help? If you need algorithmic help, I suggest you consult the Handbook of Applied Cryptography, chapter 4 (PDF), algorithm 4.62 (on page 153 or 22 in the PDF) or you independently look for Maurer's prime generation algorithm (originally published here). # I got them Mad Matrix Moves Given a list of edges representing a simple directed graph and (optionally) the number of vertices n>1, output the adjacency matrix of that graph. The vertices will always be numbered consecutively starting at 0 (or 1 -- your choice). The adjacency matrix is defined as the n by n square matrix M such that M[i][j] is 1 if there is an edge from vertex i to vertex j and 0 otherwise. # Example For this example and the test cases, we will have the vertices numbered starting at 1. Let's use the sample input [(1,2),(1,3),(3,2)]. Since there are vertices numbered 1-3, n=3 and our output is a 3 x 3 matrix. The output should be [[0, 1, 1], <= (1,1) doesn't exist in the input list, (1,2) does, (1,3) does. [0, 0, 0], <= (2,1) doesn't exist, same with (2,2) and (2,3) [0, 1, 0]] <= (3,1) doesn't exist, (3,2) does, and (3,3) doesn't  (concisely represented as [[0,1,1],[0,0,0],[0,1,0]] in test cases). # Notes • Every vertex is the start and/or end of at least one edge. • You may replace 1 and 0 in the output with any two consistent distinct values of your choosing. • The input graph is simple, meaning that it has no loops nor multiple edges (e.g. no edge [1,1] or graph [[1,2],[1,2]]) • The graph is directed, meaning that each edge has a start and an edge (e.g. the edge [1,2] is distinct from [2,1]) • Every vertex is an endpoint of at least one edge • This is , so shortest code in byes in each language wins. # Test Cases One test case per line. Each test case is in the format edges, n => output. [(1,2)], 2 => [[0,1],[0,0]] [(2,1)], 2 => [[0,0],[1,0]] [(1,2),(2,1)], 2 => [[0,1],[1,0]] [(1,2),(1,3),(3,2)], 3 => [[0,1,1],[0,0,0],[0,1,0]] [(1,2),(2,3),(3,4),(4,5)], 5 => [[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,0,0,0,0]] [(1,2),(3,4),(4,3),(2,1),(2,4),(4,2)], 4 => [[0,1,0,0],[1,0,0,1],[0,0,0,1],[0,1,1,0]] [(1,2),(2,3),(3,4),(4,5),(2,1),(3,2),(4,3),(5,4)], 5 => [[0,1,0,0,0],[1,0,1,0,0],[0,1,0,1,0],[0,0,1,0,1],[0,0,0,1,0]] [(1,2),(3,1),(2,3),(1,1),(2,1)], 3 => [[1,1,0],[1,0,1],[1,0,0]] [(1,2),(3,2),(1,3),(5,4),(5,6),(5,1),(2,3),(1,5),(5,2),(3,6),(4,5),(5,3),(2,1),(3,5),(4,6),(6,3),(6,5),(4,2),(3,4)], 6 => [[0,1,1,0,1,0],[1,0,1,0,0,0],[0,1,0,1,1,1],[0,1,0,0,1,1],[1,1,1,1,0,1],[0,0,1,0,1,0]]  # Get the Average Number of Bytes for an Answer Have you ever wanted to know the average number of bytes all the answers to a given code golf question took? Probably not. But I did! ## Input You'll have to take in a link to a codegolf exchange question by text or you can run this in a browser extension/user-script. If you have a clever way of identifying the webpage and producing the necessary output, just ask about it in the comments, and I'll update the question as long as it doesn't violate the rules. The input will be a link to a codegolf question. It will include http::// or https:://. The slashes will be facing this way: "/". The link may not be to a code-golf challenge specifically, but it could be something like a code-challenge. ## Output If the user inputs something that isn't to a code golf website output something along the lines of "Hey! That's not a link to a code-golf challenge" If the user inputs a link that links to the codegolf exchange, but isn't a codegolf (maybe it's a code-challenge) the program should output anything that is not a natural number. If there are strikethroughs through previous amounts of bytes a solution took, those should not be included in the average. If the person answering the question in one of the links did not conform to formatting standards, the program doesn't have to account for it. Minor differences will be allowed. Specifically, the number of bytes should be within 5 lines of the top of the answer and bolded. All answers should be rounded to the nearest whole number with .5 rounding up. ## Examples Input: https://codegolf.stackexchange.com/questions/54038/average-out-two-lists Output: 95 ## Winning Criterion The winner will be given by (1 / execution time (s) + bytes). If you know of anything that I missed, comment below. • What if I make the output message my entire program and then just exec it? – HyperNeutrino Oct 10 '17 at 23:30 • @HyperNeutrino I'm not really sure what that means. If it takes a link in and outputs the answer then you've completed the challenge. If it outputs the answer and 20 lines of unnecessary information that the user can see, I would say that that doesn't pass the program. – Byte11 Oct 10 '17 at 23:34 • My point is, what if I make a string containing my entire program, use string slicing to output a good falsy message, and then use exec to run the string? Would I be exempted from counting the bytes of my string? – HyperNeutrino Oct 11 '17 at 0:05 • @HyperNeutrino That's a smart way to get around the rules. No, you wouldn't be exempt from the rules, but from a literal interpretation, you could argue that that is allowed. How should most concisely update my rules to prevent this? – Byte11 Oct 11 '17 at 0:08 • I'd just guarantee that the input will follow a specific format, because making the input contain backslashes, missing components, etc. is just a pain and doesn't demonstrate the answerer's ability to actually do what you really want. Essentially, don't add too much fancy stuff – HyperNeutrino Oct 11 '17 at 0:22 • @HyperNeutrino Okay, I've updated the question. – Byte11 Oct 11 '17 at 0:47 • along the lines of  → unclear what you're asking. – user202729 Nov 3 '17 at 13:21 • Also what exactly is the winning criteria? Another point: A link to this site never have https:://, only https://. – user202729 Nov 3 '17 at 13:21 # Optimised Hashing For a given set of input, output a program that can 'hash' the input with a minimum number of collisions. ## The Challenge Write a method or function that receives an array of Strings (see input for more detail) and outputs a full program. This program must, for each String in the original input array, print to STDOUT (or equivalent) some positive integer i where i<100 and is unique for that input. ## The Input Each program will be tested with 4 different input sets of 50 unique Strings; • 50 English words of the same length. • 50 English words of differing lengths. • 50 randomly generated character strings of the same length • 50 randomly generated character strings of differing lengths All Strings in all inputs will only contain the character set [a-zA-z] (ASCII values 65-90 and 97-122) and will all be no more than 20 characters long. ## Special Rules • Standard loopholes are forbidden. • Inbuilt hashing functions are not allowed. • You must provide a free and easily accessible environment to compile and run both programs with your answer. • I reserve the right to discount any program which takes more than 10 minutes to complete any test. ## Scoring You will be scored by combining the following; • The byte count of your original program • The byte count of each outputted program • 5 penalty points for each 'collision'. I will keep and update a leader board as programs are added and I can test them. Please let me know if I've missed anything; this is my first question idea! # Hunting The Wren Write a program to produce the words to the folk song Hunting The Wren. http://www.youtube.com/watch?v=80n4CW0dE1A "We're hunting the wren." says Robin to Bobbin. "We're hunting the wren." says Richard to Robin. "We're hunting the wren." says Jack of the land. "We're hunting the wren." says everyone. "Where oh where?" says Robin to Bobbin. "Where oh where?" says Richard to Robin. "Where oh where?" says Jack of the land. "Where oh where?" says everyone.  The song continues with the same structure. "In yonder green bush." "How get him down?" "With sticks and stones." "How get him home?" "The brewer's big cart." "How will we eat him?" "With knives and forks." "Who'll come to the dinner?" "The King and the Queen."  The song concludes with three more verses, which because they have no repetition, we'll omit for the purposes of this challenge. Rules • The program must produce the full words of the song as 54 or 55 lines of text. • Each verse of four lines must be separated by a blank line. A blank line on the end is optional. • You must not use a text decompression library. (GZIP the whole song is 380 bytes.) • Normal code golf rules apply. Shortest code wins. C# Reference Implementation public class Program { public static void Main() { string[] starts = new [] { "We're hunting the wren.", "Where oh where?", "In yonder green bush.", "How get him down?", "With sticks and stones.", "How get him home?", "The brewer's big cart.", "How will we eat him?", "With knives and forks.", "Who'll come to the dinner?", "The King and the Queen." }; string[] ends = new [] { "says Robin to Bobbin.", "says Richard to Robin.", "says Jack of the land.", "says everyone." }; foreach (string start in starts) { foreach (string end in ends) { System.Console.WriteLine("\"" + start + "\" " + end); } System.Console.WriteLine(); } } }  # Pokémon Champion This challenge is about writing the ultimate bot for battling Pokémon. Since knowledge of competitive Pokémon battling is necessary, I'll leave that to the experts at Smogon University. ### Rules • Your bot must battle another bot in a Gen 7 Random Battle Format. • Your bot will be judged based on its performance in a round-robin tournament orchestrated by the author of the challenge, against all other submitted bots before a specific deadline. • In order to avoid reinventing the wheel, there are several frameworks already available to choose from. Unfortunately, a lot of these are written in Node.js, so you might still have some porting to do, unless this challenge decides to create its own framework for battling. • Since your bot will be connecting to a Showdown server using the existing Web Socket API, any error in your program that causes the bot to become non-responsive or to disconnect will automatically forfeit that match. • Standard loopholes apply, and do not exploit any possible bugs in the API. If you find a bug, please report it here. ### Further Considerations While in theory, I think this would be a great idea, I believe this would require a lot of time-investment and groundwork, which frankly I don't have the availability for right now, so anyone is free to take this over, but please be courteous and get my consent in The Nineteenth Byte first. Just @PatrickRoberts and wait for a reply before modifying this proposal. * Not sure if it's preferable to write an API specifically for this challenge to eliminate the need for Web Socket communication, since there are already available platforms. The idea is to host an official tournament at a certain date (yet undecided) on Pokémon Showdown. • I could use a new bot on my side server (the one I've got doesn't know about Z-moves so even I can beat it at Ultimate Z...) – Neil Oct 18 '17 at 0:19 # All the same digits ### Task For any two coprime integers n, b > 1 there exist infinitely many integers k > 0 for which n * k's representation in base b only contains the digit b-1. This challenge's task is to output the smallest such k for given integers n, b. ### Input Two integers n, b with the above described properties in any reasonable format (integers, strings, ...). If your language does not support arbitrary precision integers, you can assume that n, b < 2**31. ### Ouput An integer k with the above described properties in any reasonable format (integer, string, ...). If your language does not support arbitrary precision integers, you can assume that k < 2**31. ### Test cases f( n, b) == k f( 7, 10) == 142857 f( 13, 5) == 48 f( 14, 13) == 12 f(1728, 1729) == 1 f( 107, 99) == 54863250648363053681585635237627534906401818527472898624219397466199311510764517134614152141940101983414  To generate more test cases, take a look at my reference implementation written in Python 2. ### Addendum Fraction periods can also be used to calculate k (example given for n, b = 13, 10). 1/13 = 0.076923(076923)* (period length 6) 1/13 * 10**6 = 076923.076923(076923)* 1/13 * (10**6-1) = 076923 999999 = 076923 * 13 k = 76923  • Not true. Consider n=b>1. You need a coprimality condition. – Peter Taylor Oct 17 '17 at 16:03 • @PeterTaylor Thanks for noting. – Jonathan Frech Oct 17 '17 at 17:38 I'm posting this on sandbox first, because this might not be a good challenge for this site, or just too complicated, because it's about constructing a meaningful sentence. Please, tell me, if it's appropriate task for this site. Also a note: If you want, I can wait for Christmas with this. # Back to the New Year! You encounter a probably hard challenge. Inspired by this answer by @dansalmo. If we sum character codes in the string Happy new year to you!, we will get 2014. With later years, people started to modify the string, so it fits the current year: • 2015: A Happy New Year to You! • 2016: Happy New Year to you!!! ## The challenge Given an integer year, output a string meaning "Happy new year!". Sum of character codes should be equal to the integer. Rules: • No default loop holes allowed • Output rules: • Meaning rules: • You must use the word Happy - you cannot use any other adjective instead. • You must wish a NEW year, no matter if it's 2010 or 2020! • You can only wish a happy new year - You can't wish a happy new Easter... • You can target the string to a person or group, or to everybody: Happy new year!, Happy new year, Soaku!, Happy new year, CodeGolfers! • You can add new words, but the sentence can't lose the meaning! • Output must have valid grammar, but you can mess up the punctuation. Just note that you can't use punctuation characters except trailing exclamation marks. • Letter case rules: • First word must start with uppercase letter. • Any other word can start with uppercase or lowercase. • Letters that aren't first should be lowercase. The only exception is when all letters in the word are uppercase. • Punctuation rules: • You are not allowed to use any punctuation characters, except on the end of the string • There must be exactly one or three exclamation marks ! at the end. • Spacing rules: • There must be exactly one space between words. • No line breaks allowed • Leading and trailing spaces/newlines are allowed, but they don't count in the character code sum. Word is the same as outputting Word. • Character rules: • You cannot use digits! • You must only use ASCII letters (the only exception are the trailing exclamation marks) • You can assume the input is an integer between 2000 and 3000 ## Test cases examples, don't need to be the same 2001 - Happy new YEAR to MYSELF! 2002 - A VERY HAPPY NEW YEAR TO PPCG! 2003 - Happy NEW Year TO MYSELF!!! 2004 - A happy new year to me! 2013 - A HAPPY NEW Year To The SE!!! 2014 - Happy new year to you! 2015 - A Happy New Year to You! 2016 - Happy New Year to you!!! 2030 - A Happy New Year To PPCG!!!  Please, suggest any changes and upgrades in the comments • I think meaning "Happy new year!" is too unclear. There is no way to objectively enforce this. – Ad Hoc Garf Hunter Oct 23 '17 at 17:38 # Behavior Driven Golfing ### Context From wikipedia (emphasis mine): Behavior Driven Development (BDD) is largely facilitated through the use of a simple domain-specific language (DSL) using natural language constructs (e.g., English-like sentences) that can express the behavior and the expected outcomes. Example in normal BDD (also from Wikipedia): Story: Returns go to stock As a store owner In order to keep track of stock I want to add items back to stock when they're returned. ### The challenge: Write a program that reads like a single English-like sentence that executes the meaning of that sentence. ### Other details • The program must receive input of some kind (stdin, arguments are okay depending on your language's syntax). • The input can be limited in scope, (e.g. all real numbers, all positive even integers), but there must be infinitely many possible inputs assuming that your language doesn't have a cap. • For example, if the input is an integer, you don't actually have to handle integers beyond the language's cap, if your language happens to cap at 32 bit long, it just has to be infinitely many in theory but not necessarily in practice. • The program must have at least log(n) distinct outputs over an input space of size n. • For example, if there existed a language where convert to zero was a valid program, returning 0 on all inputs would not be okay, but printing a number of 0 equal to the base 10 number of digits of the input number would be okay. • The program should not error out on legal input. • Irregular case and unicode characters are allowed • Unicode characters will be interpreted as the similar character in English (so most commands in 05AB1E are allowed). • Words may be delimited by punctuation marks instead of spaces, but they must be delimited. • Punctuation should not be present in the middle of a word unless it's legal in English (such as an apostrophe in a contraction or a possessive) Example valid answer for all requirements except the "must take input" requirement: ### HQ9+ Print Hello, world. Since only the H character is an instruction in this language, all the other characters are ignored, and the program prints hello, world. Since case is ignored, this program does what the english sentence says it will do. • As it's currently written, the task is way too broad. The task that the program should do must be narrowed and clearly specified (e.g., "add the input with itself") in order for this to be well-received. – AdmBorkBork Oct 20 '17 at 20:00 • I like the challenge, but I think it should be popularity-contest rather than code-golf. I just feel like code-golf will attract too many answers similar to the example: pick a language that ignores most characters, then write a sentence that describes a built-in and includes that built-in as the only executed character. Popularity Contest seems like it would attract much more interesting answers. – Kamil Drakari Oct 20 '17 at 21:59 • @KamilDrakari popularity-content is typically not well received, most of those are closed. – durron597 Oct 20 '17 at 23:20 • I'm not exactly sure how we can measure "X is a similar character to Y" objectively.. Probably @Kamil is right and this should be a popularity contest. – ბიმო Oct 26 '17 at 19:02 • @BruceForte, pop-con is not a "solution" to the problem that the spec is not objective. A pop-con should have an objective validity criterion and not be amenable to an objective scoring criterion. – Peter Taylor Oct 27 '17 at 12:04 # Does the Riemann hypothesis hold? I would like to earn a million dollars, and the hardest way to do it is apparently solving one of the Millenium problems, so let's focus on one: the Riemann hypothesis. Now, how could I possibly ever solve it? By writing a computer program, of course! However, I am lazy, so I would rather have you do the work for me by making the program as short as possible (to minimize the number of key strokes required for me to verify your results) ## The challenge Your goal is to write a program in a language of your choice which would decide the Riemann hypothesis. More precisely, you should write a program which terminates iff the Riemann hypothesis fails. ## Restrictions • The program has to work when running with empty input [Sandbox note: perhaps allow input but add it to byte count?] • Standard loopholes are forbidden. • Your program must provably terminate iff RH is false. For example, submitting two programs, one trivially terminating, one trivially not terminating, and claiming one of them works, is not allowed, since neither of the programs provably works. • You must give a proof of equivalence of your program's termination with RH failing, with references to other work allowed. I give myself the right to decide whether the work referenced is valid or not, to exclude the many proofs and disproofs of RH. • If the Riemann hypothesis doesn't hold, your program can throw an error, or simply exit, as long as the program cannot continue beyond that. • You may assume you have unlimited memory and time, and also that your number types can hold real numbers of arbitrary size to arbitrary precision. • This is , so the shortest code in bytes wins! ## Sandbox comment To address the comments below, let me clarify why this challenge is most definitely solvable. Note that the problem is not of the sort "give a counterexample to RH" (if it did, then it would fall under this discussion and I completely agree it would not be a good challenge). Instead, it asks for a program whose termination depends on RH, and then one can give valid solutions regardless of the fact that RH is not solved yet. To give an analogy (following Deedlit's example), suppose we have replaced RH with Goldbach's conjecture. This conjecture surely is unresolved, but one can give a valid solution to the challenge, for example by following this pseudocode: n = 4 while true: found = false for k from 1 to n-1: if k is prime and n-k is prime: found = true break if found == false: break else: n = n+2 return 0  If Goldbach's conjecture is false, this program will eventually terminate by returning 0 (namely, when it finds the first counterexample). Otherwise, it will stay in the while loop forever. Hence it would be a valid solution. My challenge as it stands can be solved in a similar manner, perhaps using one of the many known equivalents of RH. • codegolf.meta.stackexchange.com/q/11033/45941 – Mego Oct 27 '17 at 19:47 • @Mego My proposed challenge doesn't fall under that discussion. It is not an open problem whether a solution for that problem is possible. – Wojowu Oct 27 '17 at 19:51 • Relying on open problems for challenges is not a good idea. Either it will be impossible to answer because the problem isn't solved, or answers will be trivial copy jobs of the proof once the problem is solved. This challenge relies on both an open problem (Riemann hypothesis) and an unsolvable problem (halting problem). – Mego Oct 27 '17 at 20:42 • @Mego The way I have phrased my problem makes it possible, but not trivial, once the Riemann hypothesis is unsolved. True, the problem trivializes once we get a (dis)proof of RH, but until then I don't see an issue with this problem. Also, I don't see how halting problem is in any way relevant here. – Wojowu Oct 27 '17 at 20:58 • You don't see how the halting problem is relevant in a challenge for writing problems that halt iff some unsolved problem in mathematics is true? – Mego Oct 27 '17 at 20:59 • @Mego Let me rephrase - I don't see how its unsolvability impacts the challenge in any way. – Wojowu Oct 27 '17 at 21:01 • @Mego As an example, it is straightforward to write a program that halts if and only if the Goldbach conjecture is false. Simply test out even numbers one at a time until you find one that is not the sum of two prime numbers. The unsolvability of the halting problem doesn't have any bearing on this, since we aren't relying on an algorithm that determines the halting behavior of all programs. A program that halts precisely when the Riemann Hypothesis is true could be done similarly. – Deedlit Oct 27 '17 at 22:01 • @Deedlit Can one also show that it is possible to write a program that halts iff Goldbach's conjecture is true? – Jonathan Frech Oct 27 '17 at 22:31 • @JonathanFrech I believe that's an open problem. However, thanks to your comment I've realized I have mixed things up - my challenge should've been about RH being false, not true (so just like in Deedlit's example with Goldbach). Sorry if any confusion was caused. – Wojowu Oct 27 '17 at 22:43 • @Wojowu Well, that seems solvable then. Would one, however, not simply loop through all complex numbers (as one has a lot of computational power), implement the zeta function (again, infinite computational power) and halt if they find a counterexample to the hypothesis? – Jonathan Frech Oct 27 '17 at 22:49 • @JonathanFrech It needs to be quite a bit more than that, because there are uncountably many complex numbers, so you can't loop over them all even with unbounded computing power. I believe you can do it by evaluating a contour integral around rectangles in the complex plane and looping over these rectangles. And it gets annoying around the critical line. It's definitely more complicated than just implementing the zeta function, though. – Chris Oct 28 '17 at 1:58 • @Chris Could one not loop through all possible sums of all rationals to approximate the reals, argue that every real is computable by an infinite sum of rationals, do that twice to gain a program which theoretically looks at every complex number, implement the zeta function and check if the hypothesis holds? – Jonathan Frech Oct 28 '17 at 12:02 • @JonathanFrech It's not possible to look at all possible infinite sums of rational numbers. Some (in fact, most) are uncomputable, and either way there are just too many real/complex numbers. Try to implement your algorithm in a real language like C, you will see that this simply doesn't go through. – Wojowu Oct 28 '17 at 12:06 • @JonathanFrech It is not possible to cycle through all possible complex numbers, but there are other ways which would let one verify the Riemann hypothesis. – Wojowu Oct 28 '17 at 12:17 • @Chris err, yes, that's what I meant. – Wojowu Oct 28 '17 at 20:40 # Are these numbers perfect for each other? A perfect number is a number that is the sum of its divisors. Examples of perfect numbers are:  | Divisors | Divisor sum -----+-------------------------------------------+------------- 6 | 1, 2, 3 | 6 28 | 1, 2, 4, 7, 14 | 28 496 | 1, 2, 4, 8, 16, 31, 62, 124, 248 | 496  Similarly, numbers that are perfect for each other are numbers where each is the sum of the other's divisors.  | Divisors | Divisor sum -----+-------------------------------------------+------------- 220 | 1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110 | 284 284 | 1, 2, 4, 71, 142 | 220  ## Challenge Write a program/function that takes two positive integers and outputs a truthy/falsey value based on whether they are perfect for each other. ### Specifications • Standard I/O rules apply. • Standard loopholes are forbidden. • The output must be consistent for both truthy and falsey values. • This challenge is not about finding the shortest approach in all languages, rather, it is about finding the shortest approach in each language. • Your code will be scored in bytes, usually in the encoding UTF-8, unless specified otherwise. • Built-in functions that perform this task are allowed but including a solution that doesn't rely on a built-in is encouraged. • Explanations, even for "practical" languages, are encouraged. ## Test cases Input Output 1, 1 truthy 3, 7 falsey 6, 6 truthy 13, 42 falsey 220, 284 truthy 563, 492 truthy 1184, 1210 truthy  In a few better formats: 1, 1 3, 7 6, 6 13, 42 220, 284 563, 492 1184, 1210 1 1 3 7 6 6 13 42 220 284 563 492 1184 1210  ## Reference implementation This is written in Haskell. divisors :: Integer -> [Integer] divisors 1 = [1] divisors n = [i | i <- [1..n - 1], n mod i == 0] perfectPair :: (Integer, Integer) -> Bool perfectPair (a, b) = (sum$ divisors a) == b && (sum \$ divisors b) == a


Try it online!

This challenge was sandboxed.

• Although I wouldn't really VTC (seems fine to me), this is very likely to be closed as a dupe of Am I perfect (number)?. – Mr. Xcoder Oct 29 '17 at 19:46
• it's also kinda trivial... Try it online! - 3 bytes, 05AB1E – Magic Octopus Urn Oct 31 '17 at 20:24

# Self-language validator

Create a language validator, which takes a string/file that might or might not be syntactically in the language of your choice, and returns a value corresponding to whether or not it is a syntactically valid program in the implementing language.

• At a bare minimum, your submission must return a truthy value for code where a strict implementation compiles/interprets without any problems, and must return a falsey value for code that even lax implementations cannot recognise as valid in your language.
• Your submission must have cases where it returns a truthy value, and cases where it returns a falsey value.
• As long as a construct is syntactically valid and could possibly be of the correct scope/type/whatever, it can be called valid. No need to dig into a repository to fetch documentation for an import or anything like that.
• Constructs whose syntactic validity depends on the current runtime execution state do not need to be checked, as statically checking their validity would necessitate reasoning about program execution.
• Appealing to external programs/libraries or to the compiler/interpreter, runtime, or standard libraries to parse or execute the string as language instructions for you would circumvent the whole point of this challenge, and thus is forbidden.
• Standard loopholes apply.
• I don't think quine is correct. Also, you might want to be more explicit that there must be a false case, as languages like Seriously are always syntactically valid. – ATaco Oct 30 '17 at 22:31
• I wonder how many languages get trivial solutions to this. – Joshua Oct 30 '17 at 22:55

# Budget my lunch!

I'm a man of habit, but I also like to live quite frugally so every day I make myself the same lunch consisting of;

• 3 Falafel
• A serving of houmous
• Some lettuce

Now in order to make sure I always put aside enough money for my lunch I need a program that will calculate the total cost of these ingredients for x number of days, and that is where you come in!

# The Challenge

Write a method that, when given two integers representing the start day and the number of days to calculate for, will return/print out a the total cost of my food for that number of days. There are several rules that this calculation follows;

• Each pack of falafel contains 8 falafels and costs £1.50. However, every three days I get lucky and the pack has 9 falafel in it!
• Each pack of flatbreads contains 6 flatbreads and costs £1.
• Each pot of houmous contains 4 servings and costs £1.10.
• Each head of lettuce provides 7 servings and costs 46p (£0.46).
• Houmous and flatbread both go off over the weekend/I eat them so have to be bought fresh on Monday.

# The Input

You will recieve two integers as input. These can be read from STDIN, passed as individual arguments, or passed as an array. Up to you.

The first integer represents the starting day e.g. 1=Monday, 2=Tuesday etc. This will always be between 1 and 5 inclusive.

The second integer is the number of days to budget for not including weekends e.g. an input of 1 and 5 would be budgeting my lunch for each day of the standard working week.

# Sample program

Below is a throroughly ungolfed program to use as reference and clarification of the above rules.

public static double budgetMyLunch(int startDay, int days){
double totalCost = 0;

final double falafelCost = 1.5;
final int falafelsInPack = 8;
int falafels = 0;
int falafelPackCount = 0;

final double flatbreadCost = 1;
final double flatbreadsInPack = 6;
int flatbreads = 0;

final double houmousCost = 1.1;
final int houmousServings = 4;
int houmous = 0;

final double lettuceCost = 0.46;
final int lettuceServings = 7;
int lettuce = 0;

int endDay = startDay + days;
int currentDay = startDay;

while(currentDay<endDay){

// If there are less than 3 falafels I have to buy some more
if(falafels<3){
falafelPackCount++;
falafels += falafelsInPack;
// Every third pack of falafel I get lucky and it has 9 instead of 8!
if(falafelPackCount%3==0) falafels++;
totalCost += falafelCost;
}

// If there are less than 2 flatbreads I have to buy some more
}

// If there are no servings of houmous left I have to buy some more
if(houmous == 0){
houmous += houmousServings;
totalCost += houmousCost;
}

// If there is no lettuce left I have to buy some more
if(lettuce == 0){
lettuce += lettuceServings;
totalCost += lettuceCost;
}

// Use up the ingredients for my lunch!
falafels -= 3;
houmous -= 1;
lettuce -= 1;

// If it's the end of the week, I eat the remaining
// houmous and flatbread over the weekend
if(currentDay%5==0){
houmous = 0;
}

currentDay++;
}
}


# Questions for sandbox

• Any suggested tags other than ?
• Is the question of appropriate complexity to be an interesting challenge? Should I add more rules?
• Is the sample program required or are the rules clear enough on their own? If it is required should it be included in the question (as above) or linked through to somewhere like Pastebin?

# UTF-8 repair

UTF-8 is the standard by which most of the world operates. Software that was intended to take in other encodings have been modified or wrapped to use UTF-8 as input and output, some with bugs and/or sloppy adherence to the standard. Even rock-solid software with years-old implementations of UTF-8, such as Java, can contain numerous UTF-8 implementation errors.

## The challenge

Given a string of characters as input, apply a list of transformations to it. The transformations can be applied in any order, but should have the same result as if the transformations were applied in the listed order.

• Replace overlong sequences with their equivalent minimal-length encodings.
• If a byte taking the form 0b11111xxx occurs, replace it, and up to three trailing bytes of the form 0b10xxxxxx, with a single replacement character (\uFFFD).
• Replace any run of extraneous bytes taking the form 0b10xxxxxx with a single replacement character.
• If a byte of the form 0b11xxxxxx is followed by an insufficient number of bytes of the form 0b10xxxxxx (either because of a byte of the borm 0b11xxxxxx or the end of the file/string), replace it and any trailing 0b10xxxxxx bytes with a single replacement character.
• Convert a high surrogate character followed by a low surrogate character to the utf-8 encoding of the supplemental plane codepoint it represents.
• Replace extraneous surrogate characters with the replacement character.
• Remove the initial byte order mark (\uFEFF), if one occurs at the start of the string.
• Keep all other characters intact. Make particular care to make sure that null characters are handled correctly.

The following are errors:

• An inverted byte order mark (\uFFFE) occurs at the start of a string.
• The transformed string consists of more than 16 codepoints, and more than 1/8 of them correspond to bad byte sequences.
• The input string consists of more than 32 bytes, and more than 1/8 of them do not correspond to a valid character, an overlong character, or a surrogate character.

If an error occurs, use an error indication mechanism (return a null pointer, utilize a tagged union indicating an error condition, set an global error variable, throw an exception, raise a signal, whatever), and do not output anything other than an optional error message. Otherwise, print the whole transformed string.

Standard loopholes apply. As with all code golf challenges, shortest submission wins.

## Test cases:

To be added if this submission gains traction.

## Reverse a regex

The .NET regex engine has the ability to process a regex in right-to-left order. There are some subtle differences between right-to-left and left-to-right order, so for the purposes of this challenge, right-to-left order is equivalent to running a reversed regex on a reversed string.

But how do you reverse a regex? Aha, that's where you come in. You need to write a program or function that reads a regex and writes one that will match reversed strings.

Fortunately reversing regexes is quite simple: break them down into symbols and concatenate them in reverse order. The symbols you should support are as follows:

• Unquoted nonmagic characters
• Quoted characters
• Character classes (anything from [ to an unquoted ])
• Symbols with repetition suffixes (assume that any of +*? or {...} is a valid repetition suffix)
• Parenthesised regexes (the inner regex will itself need to be reversed)

So for instance the reverse of a{2,}(\*[b-g])+ is ([b-g]\*)+a{2,}.

TODO: More examples, rules, loopholes.

Should I add lookaheads/behinds to the list or is that too complex?

• Character classes and repetition suffixes, at the very least, need more detail. Obviously some advanced repetition suffixes simply can't work, but which ones should be implemented? – Peter Taylor Nov 3 '17 at 11:16
• @PeterTaylor I don't understand why they can't work. You'll be able to assume that the input is a valid regex, so you'll be able to treat a+? as the symbol a+ with a suffix of ?. – Neil Nov 3 '17 at 13:42
• I had possessive quantifiers particularly in mind. I do retract the "obviously": now that I'm trying to think of an explicit example, it's not easy. But I'm still confident that one can be constructed. – Peter Taylor Nov 3 '17 at 18:26